Stochastic Algorithms: Foundations and Applications
Springer Berlin (Verlag)
978-3-540-29498-6 (ISBN)
Systems of Containers and Enumeration Problems.- Some Heuristic Analysis of Local Search Algorithms for SAT Problems.- Clustering in Stochastic Asynchronous Algorithms for Distributed Simulations.- On Construction of the Set of Irreducible Partial Covers.- Recent Advances in Multiobjective Optimization.- Polynomial Time Checking for Generation of Finite Distributions of Rational Probabilities.- FPL Analysis for Adaptive Bandits.- On Improved Least Flexibility First Heuristics Superior for Packing and Stock Cutting Problems.- Evolutionary Testing Techniques.- Optimal Fuzzy CLOS Guidance Law Design Using Ant Colony Optimization.- On Some Bounds on the Size of Branching Programs (A Survey).- Two Metaheuristics for Multiobjective Stochastic Combinatorial Optimization.- Self-replication, Evolvability and Asynchronicity in Stochastic Worlds.- New Computation Paradigm for Modular Exponentiation Using a Graph Model.- Dynamic Facility Location with Stochastic Demands.- The Complexity of Classical and Quantum Branching Programs: A Communication Complexity Approach.- On the Properties of Asymptotic Probability for Random Boolean Expression Values in Binary Bases.- Solving a Dynamic Cell Formation Problem with Machine Cost and Alternative Process Plan by Memetic Algorithms.- Eco-Grammar Systems as Models for Parallel Evolutionary Algorithms.
Erscheint lt. Verlag | 13.10.2005 |
---|---|
Reihe/Serie | Lecture Notes in Computer Science | Theoretical Computer Science and General Issues |
Zusatzinfo | VIII, 240 p. |
Verlagsort | Berlin |
Sprache | englisch |
Maße | 155 x 235 mm |
Gewicht | 800 g |
Themenwelt | Informatik ► Theorie / Studium ► Algorithmen |
Mathematik / Informatik ► Mathematik ► Wahrscheinlichkeit / Kombinatorik | |
Schlagworte | algorithm • Algorithm analysis and problem complexity • algorithms • ant colony optimization • Approximation • combinatorial optimization • Complexity • eco-grammar systems • Erfüllbarkeitsproblem der Aussagenlogik • evolutionary algorithm • evolutionary algorithms • nondeterministic computation • Optimization • probabilistic transformations • quantum computations • Randomization • randomized communication • randomized computation • randomized local search • Simulated annealing • Stochastic algorithms • Stochastic Automata • stochastic learning |
ISBN-10 | 3-540-29498-8 / 3540294988 |
ISBN-13 | 978-3-540-29498-6 / 9783540294986 |
Zustand | Neuware |
Haben Sie eine Frage zum Produkt? |
aus dem Bereich