Stochastic Algorithms: Foundations and Applications (eBook, PDF)
52,95 €
52,95 €
inkl. MwSt.
Sofort per Download lieferbar
Versandkostenfrei*
26 °P sammeln
52,95 €
52,95 €
inkl. MwSt.
Sofort per Download lieferbar
Versandkostenfrei*

Alle Infos zum eBook verschenken
26 °P sammeln
Als Download kaufen
52,95 €
inkl. MwSt.
Sofort per Download lieferbar
26 °P sammeln
Jetzt verschenken
52,95 €
inkl. MwSt.
Sofort per Download lieferbar

Alle Infos zum eBook verschenken
26 °P sammeln
  • Format: PDF


Produktdetails
  • Verlag: Springer-Verlag GmbH
  • Seitenzahl: 240
  • Erscheinungstermin: 03.11.2005
  • Englisch
  • ISBN-13: 9783540322450
  • Artikelnr.: 44129551

Dieser Download kann aus rechtlichen Gründen nur mit Rechnungsadresse in A, B, BG, CY, CZ, D, DK, EW, E, FIN, F, GR, HR, H, IRL, I, LT, L, LR, M, NL, PL, P, R, S, SLO, SK ausgeliefert werden.

Autorenporträt
Oleg B. Lupanov, Moscow State University, Russia / Oktay M. Kasim-Zade, Moscow State University, Russia / Alexander V. Chaskin, Moscow State University, Russia / Kathleen Steinhöfel, Fraunhofer Institute for Computer Architecture and Software Technology (FIRST), Berlin, Germany
Inhaltsangabe
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.