Seems you have not registered as a member of localhost.saystem.shop!
You may have to register before you can download all our books and magazines, click the sign up button below to create a free account.
On-line Algorithms
This volume contains the proceedings of the Workshop on On-line Algorithms held at the DIMACS Center at Rutgers University in February 1991. Presenting new results in the theory of on-line algorithms, the articles discuss a broad range of problems. Most of the papers are based on competitive (worst-case) analysis of on-line algorithms, but some consider alternative approaches. This book is aimed primarily at specialists in algorithm analysis, but most of the articles present clear expositions of previous work.
Optimal Reliability Modeling
Promotes better ways to diagnose, maintain, and improve existing systems. Existing reliability evaluation models are examined with respect to today's complicated engineering systems that have hundreds of thousands of integrated component designs.
Computing in Euclidean Geometry
This book is a collection of surveys and exploratory articles about recent developments in the field of computational Euclidean geometry. The topics covered are: a history of Euclidean geometry, Voronoi diagrams, randomized geometric algorithms, computational algebra; triangulations, machine proofs, topological designs, finite-element mesh, computer-aided geometric designs and steiner trees. Each chapter is written by a leading expert in the field and together they provide a clear and authoritative picture of what computational Euclidean geometry is and the direction in which research is going.
Ordinary Differential Equations With Applications (2nd Edition)
During the past three decades, the development of nonlinear analysis, dynamical systems and their applications to science and engineering has stimulated renewed enthusiasm for the theory of Ordinary Differential Equations (ODE).This useful book, which is based on the lecture notes of a well-received graduate course, emphasizes both theory and applications, taking numerous examples from physics and biology to illustrate the application of ODE theory and techniques.Written in a straightforward and easily accessible style, this volume presents dynamical systems in the spirit of nonlinear analysis to readers at a graduate level and serves both as a textbook and as a valuable resource for researchers.This new edition contains corrections and suggestions from the various readers and users. A new chapter on Monotone Dynamical Systems is added to take into account the new developments in ordinary differential equations and dynamical systems.
Advanced Routing of Electronic Modules
The rapid growth of the electronic products market has created an increasing need for affordable, reliable, high-speed and high-density multi-layer printed circuit boards (PCBs). This book presents the technologies, algorithms, and methodologies for engineers and others developing the next generation of electronic products. A vision of the future in advanced electronics Advanced Routing of Electronic Modules provides both fundamental theory and advanced technologies for improving routing. Beginning chapters discuss approaches to approximate a minimum rectilinear Steiner tree from a minimum spanning tree and introduce ways to avoid obstacles for routing simple multi-terminal nets sequentially...
Combinatorial Group Testing and Its Applications
Du (computer science, City U. of Hong Kong) and Hwant (applied mathematics, National Chiao Tung U., Taiwan) assemble the theories and applications of a technique for testing blood on a large scale economically. They say it was developed about 50 years ago, but went dormant when the immediate need passed, and think it might be useful again now what with the AIDS epidemic and all. They mention no date for the first edition; not only have they updated results and corrected errors here, they have also incorporated the recent extensive application of non-adaptive group testing to the clone library screening problem. Annotation copyrighted by Book News, Inc., Portland, OR
Approximation and Complexity in Numerical Optimization
There has been much recent progress in approximation algorithms for nonconvex continuous and discrete problems from both a theoretical and a practical perspective. In discrete (or combinatorial) optimization many approaches have been developed recently that link the discrete universe to the continuous universe through geomet ric, analytic, and algebraic techniques. Such techniques include global optimization formulations, semidefinite programming, and spectral theory. As a result new ap proximate algorithms have been discovered and many new computational approaches have been developed. Similarly, for many continuous nonconvex optimization prob lems, new approximate algorithms have been devel...
Theoretical Computer Science - Proceedings Of The Fifth Italian Conference
The Fifth Italian Conference on Theoretical Computer Science covers all aspects of Theoretical Computer Science. Among the topics addressed in the volume are Algorithms, Concurrency, Automata, Formal Languages, Computational Complexity, Temporal and Model Logic, Logic Programming, and λ-Calculus.The proceedings include 33 selected papers and three distinguished invited lectures by Michael Luby, Ugo Montanari and Alberto Bertoni.
Minimax and Applications
Techniques and principles of minimax theory play a key role in many areas of research, including game theory, optimization, and computational complexity. In general, a minimax problem can be formulated as min max f(x, y) (1) ",EX !lEY where f(x, y) is a function defined on the product of X and Y spaces. There are two basic issues regarding minimax problems: The first issue concerns the establishment of sufficient and necessary conditions for equality minmaxf(x,y) = maxminf(x,y). (2) "'EX !lEY !lEY "'EX The classical minimax theorem of von Neumann is a result of this type. Duality theory in linear and convex quadratic programming interprets minimax theory in a different way. The second issue concerns the establishment of sufficient and necessary conditions for values of the variables x and y that achieve the global minimax function value f(x*, y*) = minmaxf(x, y). (3) "'EX !lEY There are two developments in minimax theory that we would like to mention.
Nonblocking Electronic and Photonic Switching Fabrics
Surveys recent advances in combinatorial properties of switching fabrics Written by an expert in the area of switching fabrics
