Choose an application

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

This clearly written, mathematically rigorous text includes a novel algorithmic exposition of the simplex method and also discusses the Soviet ellipsoid algorithm for linear programming; efficient algorithms for network flow, matching, spanning trees, and matroids; the theory of NP-complete problems; approximation algorithms, local search heuristics for NP-complete problems, more. All chapters are supplemented by thought-provoking problems. A useful work for graduate-level students with backgrounds in computer science, operations research, and electrical engineering. "Mathematicians wishing a self-contained introduction need look no further."& American Mathematical Monthly. 1982 ed.

Discrete mathematics --- Mathematical optimization --- Combinatorial optimization --- Computational complexity. --- Optimisation mathématique --- Optimisation combinatoire --- Complexité de calcul (Informatique) --- Computational Complexity --- Mathematical optimization. --- Combinatorial optimization. --- Complexity, Computational --- Electronic data processing --- Machine theory --- Optimization, Combinatorial --- Combinatorial analysis --- Optimization (Mathematics) --- Optimization techniques --- Optimization theory --- Systems optimization --- Mathematical analysis --- Maxima and minima --- Operations research --- Simulation methods --- System analysis --- Optimisation mathématique --- Complexité de calcul (Informatique) --- Computational complexity

Choose an application

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

Optimization Techniques is a unique reference source to a diverse array of methods for achieving optimization, and includes both systems structures and computational methods. The text devotes broad coverage toa unified view of optimal learning, orthogonal transformation techniques, sequential constructive techniques, fast back propagation algorithms, techniques for neural networks with nonstationary or dynamic outputs, applications to constraint satisfaction,optimization issues and techniques for unsupervised learning neural networks, optimum Cerebellar Model of Articulation Controller

Computer science. --- Mathematical optimization. --- Neural networks (Computer science). --- Civil & Environmental Engineering --- Engineering & Applied Sciences --- Operations Research --- Neural networks (Computer science) --- Réseaux neuronaux (informatique) --- Optimization (Mathematics) --- Optimization techniques --- Optimization theory --- Systems optimization --- Artificial neural networks --- Nets, Neural (Computer science) --- Networks, Neural (Computer science) --- Neural nets (Computer science) --- Mathematical analysis --- Maxima and minima --- Operations research --- Simulation methods --- System analysis --- Artificial intelligence --- Natural computation --- Soft computing --- Mathematical optimization --- E-books

Choose an application

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

Targeted audience • Specialists in numerical computations, especially in numerical optimiza­ tion, who are interested in designing algorithms with automatie result ver­ ification, and who would therefore be interested in knowing how general their algorithms caIi in principle be. • Mathematicians and computer scientists who are interested in the theory 0/ computing and computational complexity, especially computational com­ plexity of numerical computations. • Students in applied mathematics and computer science who are interested in computational complexity of different numerical methods and in learning general techniques for estimating this computational complexity. The book is written with all explanations and definitions added, so that it can be used as a graduate level textbook. What this book .is about Data processing. In many real-life situations, we are interested in the value of a physical quantity y that is diflicult (or even impossible) to measure directly. For example, it is impossible to directly measure the amount of oil in an oil field or a distance to a star. Since we cannot measure such quantities directly, we measure them indirectly, by measuring some other quantities Xi and using the known relation between y and Xi'S to reconstruct y. The algorithm that transforms the results Xi of measuring Xi into an estimate fj for y is called data processing.

Programming --- Computer science --- Computational complexity --- Numerical calculations --- Interval analysis (Mathematics) --- Complexité de calcul (Informatique) --- Calculs numériques --- Data processing --- Informatique --- Complexité de calcul (Informatique) --- Calculs numériques --- Computer mathematics. --- Computers. --- Mathematical optimization. --- Mathematical models. --- Applied mathematics. --- Engineering mathematics. --- Computational Mathematics and Numerical Analysis. --- Theory of Computation. --- Optimization. --- Mathematical Modeling and Industrial Mathematics. --- Applications of Mathematics. --- Engineering --- Engineering analysis --- Mathematical analysis --- Models, Mathematical --- Simulation methods --- Optimization (Mathematics) --- Optimization techniques --- Optimization theory --- Systems optimization --- Maxima and minima --- Operations research --- System analysis --- Automatic computers --- Automatic data processors --- Computer hardware --- Computing machines (Computers) --- Electronic brains --- Electronic calculating-machines --- Electronic computers --- Hardware, Computer --- Computer systems --- Cybernetics --- Machine theory --- Calculators --- Cyberspace --- Computer mathematics --- Electronic data processing --- Mathematics --- Computational complexity. --- Data processing. --- Analysis, Interval --- Arithmetic, Interval --- Interval arithmetic --- Interval mathematics --- Mathematics, Interval --- Numerical analysis --- Complexity, Computational

Choose an application

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

This coherent anthology presents the state of the art in the booming area of online algorithms and competitive analysis of such algorithms. The 17 papers are carefully revised and thoroughly improved versions of presentations given first during a Dagstuhl seminar in 1996. An overview by the volume editors introduces the area to the reader. The technical chapters are devoted to foundational and methodological issues for the design and analysis of various classes of online algorithms as well as to the detailed evaluation of algorithms for various activities in online processing, ranging from load balancing and scheduling to networking and financial problems. An outlook by the volume editors and a bibliography listing more than 750 references complete the work. The book is ideally suited for advanced courses and self-study in online algorithms. It is indispensable reading for researchers and professionals active in the area.

Online algorithms --- Computer Science --- Engineering & Applied Sciences --- Computer science. --- Computer communication systems. --- Computer programming. --- Algorithms. --- Computer science --- Calculus of variations. --- Computer Science. --- Computer Communication Networks. --- Algorithm Analysis and Problem Complexity. --- Programming Techniques. --- Discrete Mathematics in Computer Science. --- Calculus of Variations and Optimal Control; Optimization. --- Mathematics. --- Isoperimetrical problems --- Variations, Calculus of --- Maxima and minima --- Computer mathematics --- Discrete mathematics --- Electronic data processing --- Algorism --- Algebra --- Arithmetic --- Computers --- Electronic computer programming --- Electronic digital computers --- Programming (Electronic computers) --- Coding theory --- Communication systems, Computer --- Computer communication systems --- Data networks, Computer --- ECNs (Electronic communication networks) --- Electronic communication networks --- Networks, Computer --- Teleprocessing networks --- Data transmission systems --- Digital communications --- Electronic systems --- Information networks --- Telecommunication --- Cyberinfrastructure --- Network computers --- Informatics --- Science --- Mathematics --- Foundations --- Programming --- Distributed processing --- Computer software. --- Computational complexity. --- Mathematical optimization. --- Optimization (Mathematics) --- Optimization techniques --- Optimization theory --- Systems optimization --- Mathematical analysis --- Operations research --- Simulation methods --- System analysis --- Complexity, Computational --- Machine theory --- Software, Computer --- Computer systems --- Computer science—Mathematics. --- Computer networks.

Choose an application

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

Decision Making --- Fuzzy sets --- Mathematical optimization. --- 519.2 --- 519.8 --- 681.3*I51 <063> --- Probability. Mathematical statistics --- Operational research --- Models: deterministic; fuzzy set; geometric; statistical; structural (Patternrecognition)--Congressen --- Decision-making. --- Fuzzy sets. --- Basic Sciences. Mathematics --- Mathematical Models, Simulation Models --- Mathematical Models, Simulation Models. --- 519.8 Operational research --- 519.2 Probability. Mathematical statistics --- 681.3*I51 <063> Models: deterministic; fuzzy set; geometric; statistical; structural (Patternrecognition)--Congressen --- Decision making. --- Decision-making --- Mathematical optimization --- Optimization (Mathematics) --- Optimization techniques --- Optimization theory --- Systems optimization --- Mathematical analysis --- Maxima and minima --- Operations research --- Simulation methods --- System analysis --- Sets, Fuzzy --- Fuzzy mathematics --- Set theory --- Deciding --- Decision (Psychology) --- Decision analysis --- Decision processes --- Making decisions --- Management --- Management decisions --- Choice (Psychology) --- Problem solving --- Decision making