Listing 1 - 10 of 10 |
Sort by
|
Choose an application
Combinatorial optimization --- Algorithms --- Optimisation combinatoire --- Algorithmes
Choose an application
Solving combinatorial optimization problems can often lead to runtime growing exponentially as a function of the input size. But important real-world problems, industrial applications, and academic research challenges, may demand exact optimal solutions. In such situations, parallel processing can reduce the runtime from days or months, typical when one workstation is used, to a few minutes or even seconds.Partners of the CEC-sponsored SCOOP Project (Solving Combinatorial Optimization Problems in Parallel) contributed, on invitation, to this book; much attention was paid to competent coverage of the topic and the style of writing. Readers will include students, scientists, engineers, and professionals interested in the design and implementation of parallel algorithms for solving combinatorial optimization problems.
Parallel processing (Electronic computers) --- Parallelle verwerking (Computers) --- Traitement parallèle (Ordinateurs) --- Combinatorial optimization --- Data processing. --- Parallel processing (Electronic computers). --- Data processing --- Combinatorial optimization - Data processing. --- Computer network architectures. --- Computer science. --- Numerical analysis. --- Combinatorics. --- Information technology. --- Engineering. --- Computer System Implementation. --- Computation by Abstract Devices. --- Numerical Analysis. --- IT in Business. --- Complexity. --- Construction --- Industrial arts --- Technology --- IT (Information technology) --- Telematics --- Information superhighway --- Knowledge management --- Combinatorics --- Algebra --- Mathematical analysis --- Informatics --- Science --- Architectures, Computer network --- Network architectures, Computer --- Computer architecture --- Combinatorial optimization - Data processing
Choose an application
This book presents a collection of 33 strictly refereed full papers on combinatorics and computer science; these papers have been selected from the 54 papers accepted for presentation at the joint 8th Franco-Japanese and 4th Franco-Chinese Conference on Combinatorics in Computer Science, CCS '96, held in Brest, France in July 1995. The papers included in the book have been contributed by authors from 10 countries; they are organized in sections entitled graph theory, combinatorial optimization, selected topics, and parallel and distributed computing.
Graph theory --- Combinatorial optimization --- Computer science --- Congresses. --- Combinatorial analysis --- Congresses --- Mathematics --- Information theory. --- Computer Communication Networks. --- Combinatorics. --- Numerical analysis. --- Computer science. --- Discrete Mathematics. --- Theory of Computation. --- Numerical Analysis. --- Programming Techniques. --- Informatics --- Science --- Mathematical analysis --- Combinatorics --- Algebra --- Communication theory --- Communication --- Cybernetics --- Graph theory - Congresses. --- Combinatorial optimization - Congresses. --- Computer science - Congresses.
Choose an application
C++ (Computer program language) --- Genetic algorithms --- 681.3*D3 --- 681.3*D3 Programming languages --- Programming languages --- GAs (Algorithms) --- Genetic searches (Algorithms) --- Algorithms --- Combinatorial optimization --- Evolutionary computation --- Genetic programming (Computer science) --- Learning classifier systems --- Programming
Choose an application
This volume presents the proceedings of the Fifth Integer Programming and Combinatorial Optimization Conference, IPCO V, held in Vancouver, British Columbia, Canada, in June 1996. The 36 revised papers included in the book were selected from a total of 99 submissions; they highlight recent developments in theory, computation, and applications of integer programming and combinatorial optimization. The volume is organized in sections on integer programming theory and models, network flow algorithms, approximation algorithms, semi-definite methods, matrix models, set systems and submodularity, scheduling, probabilistic methods, polyhedral methods, and the traveling salesman problem.
Discrete programmering --- Integer programming --- Programmation en nombres entiers --- Combinatorial optimization --- Congresses --- Congresses. --- Information theory. --- Distribution (Probability theory. --- Software engineering. --- Computer software. --- Mathematical optimization. --- Combinatorics. --- Theory of Computation. --- Probability Theory and Stochastic Processes. --- Software Engineering/Programming and Operating Systems. --- Algorithm Analysis and Problem Complexity. --- Calculus of Variations and Optimal Control; Optimization. --- Combinatorics --- Algebra --- Mathematical analysis --- Optimization (Mathematics) --- Optimization techniques --- Optimization theory --- Systems optimization --- Maxima and minima --- Operations research --- Simulation methods --- System analysis --- Software, Computer --- Computer systems --- Computer software engineering --- Engineering --- Distribution functions --- Frequency distribution --- Characteristic functions --- Probabilities --- Communication theory --- Communication --- Cybernetics --- Integer programming - Congresses --- Combinatorial optimization - Congresses
Choose an application
Comparing the three most prominent representatives of evolutionary algorithms - genetic algorithms, evolution strategies and evolutionary programming - this book examines the computational methods at the border between computer science and evolutionary biology. The algorithms are explained within a common framework, thereby clarifying the similarities and differences of these methods. The author also presents new results regarding the role of mutation and selection in genetic algorithms and uses a meta-evolutionary approach to confirm some of the theoretical results.
Evolution (Biology). --- Evolutionary programming (Computer science). --- Genetic algorithms. --- Genetic algorithms --- Evolution (Biology) --- Evolutionary programming (Computer science) --- Operations Research --- Civil & Environmental Engineering --- Engineering & Applied Sciences --- Mathematical models --- Mathematical models. --- GAs (Algorithms) --- Genetic searches (Algorithms) --- Algorithms --- Combinatorial optimization --- Evolutionary computation --- Genetic programming (Computer science) --- Learning classifier systems --- Computer programming --- Artificial intelligence --- E-books
Choose an application
Genetic Algorithms in Molecular Modeling is the first book available on the use of genetic algorithms in molecular design. This volume marks the beginning of an ew series of books, Principles in Qsar and Drug Design, which will be an indispensible reference for students and professionals involved in medicinal chemistry, pharmacology, (eco)toxicology, and agrochemistry. Each comprehensive chapter is written by a distinguished researcher in the field.Through its up to the minute content, extensive bibliography, and essential information on software availability, this book leads the reader fr
Genetic algorithms. --- Molecules --- Drugs --- QSAR (Biochemistry) --- Models. --- Design. --- Basic Sciences. Molecular Biology --- Molecular Biology (General). --- GAs (Algorithms) --- Genetic searches (Algorithms) --- Algorithms --- Combinatorial optimization --- Evolutionary computation --- Genetic programming (Computer science) --- Learning classifier systems --- Quantitative structure-activity relationships (Biochemistry) --- Structure-activity relationships (Biochemistry) --- Molecules - Models. --- Drugs - Design.
Choose an application
Operational research. Game theory --- Heuristic programming --- Combinatorial optimization --- 519.8 --- 681.3*I28 --- Artificial intelligence --- Programming (Mathematics) --- Optimization, Combinatorial --- Combinatorial analysis --- Mathematical optimization --- Operational research --- Problem solving, control methods and search: backtracking; dynamic program- ming; graph and tree search strategies; heuristics; plan execution, formationand generation (Artificial intelligence)--See also {681.3*F22} --- 681.3*I28 Problem solving, control methods and search: backtracking; dynamic program- ming; graph and tree search strategies; heuristics; plan execution, formationand generation (Artificial intelligence)--See also {681.3*F22} --- 519.8 Operational research
Choose an application
Combinatorial optimization --- Computer algorithms. --- Data processing. --- Planning (firm) --- -Computer algorithms --- 681.3*I28 --- 681.3*I28 Problem solving, control methods and search: backtracking; dynamic program- ming; graph and tree search strategies; heuristics; plan execution, formationand generation (Artificial intelligence)--See also {681.3*F22} --- Problem solving, control methods and search: backtracking; dynamic program- ming; graph and tree search strategies; heuristics; plan execution, formationand generation (Artificial intelligence)--See also {681.3*F22} --- Algorithms --- Optimization, Combinatorial --- Combinatorial analysis --- Mathematical optimization --- Computer algorithms --- Data processing --- Artificial intelligence. Robotics. Simulation. Graphics
Choose an application
Computer science --- Artificial intelligence. Robotics. Simulation. Graphics --- 681.3*I12 --- 510.5 --- Genetic programming (Computer science) --- Learning classifier systems --- File organization (Computer science) --- Abstract data types (Computer science) --- Analysis of algorithms and problem complexity--See also {681.3*B6} {681.3*B7} {681.3*F13} --- Algorithms: algebraic algorithms nonalgebraic algorithms analysis of algorithms (Algebraic manipulation computing methodologies) --- Algorithms. Computable functions --- Genetic Algorithms. --- 510.5 Algorithms. Computable functions --- 681.3*I12 Algorithms: algebraic algorithms nonalgebraic algorithms analysis of algorithms (Algebraic manipulation computing methodologies) --- 681.3*F2 Analysis of algorithms and problem complexity--See also {681.3*B6} {681.3*B7} {681.3*F13} --- Algorithmes (Ordinateur) --- Algoritmen (Computer) --- Données [Structures de ] (Informatique) --- Gegevensstructuren (Informatica) --- Programmes d'ordinateur --- Programmation évolutive --- Analysis of algorithms and problem complexity--See also {681.3*B6}; {681.3*B7}; {681.3*F13} --- Algorithms: algebraic algorithms; nonalgebraic algorithms; analysis of algorithms (Algebraic manipulation; computing methodologies) --- 681.3*I12 Algorithms: algebraic algorithms; nonalgebraic algorithms; analysis of algorithms (Algebraic manipulation; computing methodologies) --- 681.3*F2 Analysis of algorithms and problem complexity--See also {681.3*B6}; {681.3*B7}; {681.3*F13} --- Structures de données (Informatique) --- Programmation évolutive --- Algorithmes génétiques --- Data structures (Computer science) --- Evolutionary programming (Computer science) --- Genetic algorithms --- 681.3*F2 --- GAs (Algorithms) --- Genetic searches (Algorithms) --- Algorithms --- Combinatorial optimization --- Evolutionary computation --- Computer programming --- Information structures (Computer science) --- Structures, Data (Computer science) --- Structures, Information (Computer science) --- Electronic data processing --- 681.3*I2 --- 681.3*I2 Artificial intelligence. AI --- Artificial intelligence. AI --- Discrete mathematics --- Data structures (Computer science). --- Evolutionary programming (Computer science). --- Genetic algorithms. --- Computer programs
Listing 1 - 10 of 10 |
Sort by
|