Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

The main idea behind the series of volumes Advances in Petri Nets is to present to the general computer science community recent results which are the most representative and significant for the development of the area. Thepapers for the volumes are drawn mainly from the annual International Conferences on Applications and Theory of Petri Nets. Selected papers from the latest conference are independently refereed, and revised and extended as necessary. Some further papers submitted directly to the editor are included. Advances in Petri Nets 1991 covers the 11th International Conference on Applications and Theory of Petri Nets held in Paris, France in June 1991. The volume contains the Bibliography of Petri Nets 1990 prepared by H. Pl}nnecke and W. Reisig, with over 4000 entries.

Computer architecture. Operating systems --- Petri nets --- Machine theory --- Réseaux de Pétri --- Automates mathématiques, Théorie des --- Congresses --- Congrès --- Réseaux de Pétri --- Automates mathématiques, Théorie des --- Congrès --- Computer science. --- Computer Communication Networks. --- Mathematics. --- Computer software. --- Logic design. --- Computation by Abstract Devices. --- Applications of Mathematics. --- Algorithm Analysis and Problem Complexity. --- Logics and Meanings of Programs. --- Processor Architectures. --- Design, Logic --- Design of logic systems --- Digital electronics --- Electronic circuit design --- Logic circuits --- Switching theory --- Software, Computer --- Computer systems --- Math --- Science --- Informatics

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Following Karmarkar's 1984 linear programming algorithm, numerous interior-point algorithms have been proposed for various mathematical programming problems such as linear programming, convex quadratic programming and convex programming in general. This monograph presents a study of interior-point algorithms for the linear complementarity problem (LCP) which is known as a mathematical model for primal-dual pairs of linear programs and convex quadratic programs. A large family of potential reduction algorithms is presented in a unified way for the class of LCPs where the underlying matrix has nonnegative principal minors (P0-matrix). This class includes various important subclasses such as positive semi-definite matrices, P-matrices, P*-matrices introduced in this monograph, and column sufficient matrices. The family contains not only the usual potential reduction algorithms but also path following algorithms and a damped Newton method for the LCP. The main topics are global convergence, global linear convergence, and the polynomial-time convergence of potential reduction algorithms included in the family.

Lineaire programmering --- Linear programming --- Programmation (Mathematiques) --- Programmation lineaire --- Programmeren (Wiskunde) --- Programming (Mathematics) --- #TELE:SISTA --- 681.3*G16 --- Optimization: constrained optimization; gradient methods; integer programming; least squares methods; linear programming; nonlinear programming (Numericalanalysis) --- 681.3*G16 Optimization: constrained optimization; gradient methods; integer programming; least squares methods; linear programming; nonlinear programming (Numericalanalysis) --- Linear programming. --- Mathematics. --- Numerical analysis. --- Systems theory. --- Mathematical optimization. --- Applications of Mathematics. --- Numerical Analysis. --- Systems Theory, Control. --- Calculus of Variations and Optimal Control; Optimization. --- Optimization (Mathematics) --- Optimization techniques --- Optimization theory --- Systems optimization --- Mathematical analysis --- Maxima and minima --- Operations research --- Simulation methods --- System analysis --- Math --- Science

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

With the appearance of massively parallel computers, increased attention has been paid to algorithms which rely upon analogies to natural processes. This development defines the scope of the PPSN conference at Dortmund in 1990 whose proceedings are presented in this volume. The subjects treated include: - Darwinian methods such as evolution strategies and genetic algorithms; - Boltzmann methods such as simulated annealing; - Classifier systems and neural networks; - Transfer of natural metaphors to artificial problem solving. The main objectives of the conference were: - To gather theoretical results about and experimental comparisons between these algorithms, - To discuss various implementations on different parallel computer architectures, - To summarize the state of the art in the field, which was previously scattered widely both among disciplines and geographically.

Computer architecture. Operating systems --- Neural networks (Computer science) --- -Parallel processing (Electronic computers) --- -681.3*C12 --- 681.3*I26 --- Congresses --- Multiple data stream architectures (multiprocessors): MIMD; SIMD; pipeline and parallel processors; array-, vector-, associative processors; interconnection architectures: common bus, multiport memory, crossbar switch --- Learning: analogies; concept learning; induction; knowledge acquisition; language acquisition; parameter learning (Artificial intelligence)--See also {681.3*K32} --- 681.3*I26 Learning: analogies; concept learning; induction; knowledge acquisition; language acquisition; parameter learning (Artificial intelligence)--See also {681.3*K32} --- 681.3*C12 Multiple data stream architectures (multiprocessors): MIMD; SIMD; pipeline and parallel processors; array-, vector-, associative processors; interconnection architectures: common bus, multiport memory, crossbar switch --- Parallel processing (Electronic computers) --- 681.3*C12 --- Parallel processing (Electronic computers) - Congresses. --- Neural networks (Computer science) - Congresses. --- Mathematics. --- Computer network architectures. --- Information theory. --- Computer science. --- Computer software. --- Applications of Mathematics. --- Computer System Implementation. --- Theory of Computation. --- Computation by Abstract Devices. --- Algorithm Analysis and Problem Complexity. --- Processor Architectures. --- Software, Computer --- Computer systems --- Informatics --- Science --- Communication theory --- Communication --- Cybernetics --- Architectures, Computer network --- Network architectures, Computer --- Computer architecture --- Math

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

The management and processing of uncertain information has shown itself to be a crucial issue in the development of intelligent systems, beginning withits appearance in the such systems as Mycin and Prospector. The papers in this volume reflect the current range of interests or researchers in thefield. Currently, the major approaches to uncertainty include fuzzy set theory, probabilistic methods, mathematical theory of evidence, non-standardlogics such as default reasoning, and possibility theory. The initial part of the volume is devoted to papers dealing with the foundations of these approaches, where recent attempts have been made to develop systems combining multiple approaches. A significant part of the book looks at the management of uncertainty in a number of the paradigmatic domainsof intelligent systems such as expert systems, decision making, databases, image processing, and reasoning networks. The papers are extended versions of presentations at the third international conference on information processing and management of uncertainty in knowledge-based systems. The proceedings of the two preceding IPMU conferences appear as LNCS 286 and LNCS 313.

Database management --- Uncertainty (Information theory) --- -681.3*C3 --- 681.3*H11 --- 681.3*H4 --- 681.3*I2 --- Congresses. --- Congresses --- Special-purpose and application-based systems: microprocessor/microcomputer; process control-, real-time, signal processing systems (Computer systems organization)--See also {681.3*J7} --- Systems and information theory: value of information--See also {681.3*E4} --- Information systems applications (GIS etc.) --- Artificial intelligence. AI --- 681.3*I2 Artificial intelligence. AI --- 681.3*H4 Information systems applications (GIS etc.) --- 681.3*H11 Systems and information theory: value of information--See also {681.3*E4} --- 681.3*C3 Special-purpose and application-based systems: microprocessor/microcomputer; process control-, real-time, signal processing systems (Computer systems organization)--See also {681.3*J7} --- 681.3*C3 --- Uncertainty (Information theory) - Congresses. --- Data base management - Congresses. --- Artificial intelligence. --- Mathematics. --- Computer science. --- Distribution (Probability theory. --- Statistics. --- Artificial Intelligence. --- Applications of Mathematics. --- Information Systems Applications (incl. Internet). --- Models and Principles. --- Probability Theory and Stochastic Processes. --- Statistics, general. --- Statistical analysis --- Statistical data --- Statistical methods --- Statistical science --- Mathematics --- Econometrics --- Distribution functions --- Frequency distribution --- Characteristic functions --- Probabilities --- Informatics --- Science --- Math --- AI (Artificial intelligence) --- Artificial thinking --- Electronic brains --- Intellectronics --- Intelligence, Artificial --- Intelligent machines --- Machine intelligence --- Thinking, Artificial --- Bionics --- Cognitive science --- Digital computer simulation --- Electronic data processing --- Logic machines --- Machine theory --- Self-organizing systems --- Simulation methods --- Fifth generation computers --- Neural computers

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

This book presents state-of-the-art research results in the area of formal methods for real-time and fault-tolerant systems. The papers consider problems and solutions in safety-critical system design and examine how wellthe use of formal techniques for design, analysis and verification serves in relating theory to practical realities. The book contains papers on real-time and fault-tolerance issues. Formal logic, process algebra, and action/event models are applied: - to specify and model qualitative and quantitative real-time and fault-tolerant behavior, - to analyze timeliness requirements and consequences of faulthypotheses, - to verify protocols and program code, - to formulate formal frameworks for development of real-time and fault-tolerant systems, - to formulate semantics of languages. The integration and cross-fertilization of real-time and fault-tolerance issues have brought newinsights in recent years, and these are presented in this book.

681.3*G3 --- Fault-tolerant computing --- -Real-time data processing --- -681.3*B13 --- 681.3*F12 --- 681.3*F3 --- 681.3*F43 --- Fast-response data processing --- High-speed data processing --- Electronic data processing --- Computing, Fault-tolerant --- Electronic digital computers --- Fault tolerance (Engineering) --- Computer system failures --- Probability and statistics: probabilistic algorithms (including Monte Carlo);random number generation; statistical computing; statistical software (Mathematics of computing) --- Congresses --- Control structure reliability, testing and fault-tolerance: diagnostics, error-checking, redundant design, test generation --- Modes of computation: alternation and nondeterminism; parallelism; probabilistic computation; relations among modes; relativized computation --- Logics and meanings of programs (Theory of computation) --- Formal languages: algebraic language theory; classes defined by grammars or automata or by resource-bounded automata; operations on languages (Mathematical logic and formal languages)--See also {681.3*D31} --- Reliability --- Real-time data processing --- Congresses. --- 681.3*F43 Formal languages: algebraic language theory; classes defined by grammars or automata or by resource-bounded automata; operations on languages (Mathematical logic and formal languages)--See also {681.3*D31} --- 681.3*F3 Logics and meanings of programs (Theory of computation) --- 681.3*F12 Modes of computation: alternation and nondeterminism; parallelism; probabilistic computation; relations among modes; relativized computation --- 681.3*B13 Control structure reliability, testing and fault-tolerance: diagnostics, error-checking, redundant design, test generation --- 681.3*G3 Probability and statistics: probabilistic algorithms (including Monte Carlo);random number generation; statistical computing; statistical software (Mathematics of computing) --- 681.3*B13 --- Real-time data processing - Congresses. --- Fault-tolerant computing - Congresses. --- Information theory. --- Mathematics. --- Logic, Symbolic and mathematical. --- Logic design. --- Distribution (Probability theory. --- Statistics. --- Theory of Computation. --- Applications of Mathematics. --- Mathematical Logic and Foundations. --- Logics and Meanings of Programs. --- Probability Theory and Stochastic Processes. --- Statistics, general. --- Statistical analysis --- Statistical data --- Statistical methods --- Statistical science --- Mathematics --- Econometrics --- Distribution functions --- Frequency distribution --- Characteristic functions --- Probabilities --- Design, Logic --- Design of logic systems --- Digital electronics --- Electronic circuit design --- Logic circuits --- Machine theory --- Switching theory --- Algebra of logic --- Logic, Universal --- Mathematical logic --- Symbolic and mathematical logic --- Symbolic logic --- Algebra, Abstract --- Metamathematics --- Set theory --- Syllogism --- Math --- Science --- Communication theory --- Communication --- Cybernetics