Detail Cantuman
Pencarian SpesifikE Book
Stochastic Algorithms: Foundations and Applications
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.
Ketersediaan
Tidak ada salinan data
Informasi Detil
Judul Seri |
-
|
---|---|
No. Panggil |
-
|
Penerbit | : ., |
Deskripsi Fisik |
VIII, 240 p.online resource.
|
Bahasa |
English
|
ISBN/ISSN |
9783540322450
|
Klasifikasi |
005.1
|
Tipe Isi |
-
|
Tipe Media |
-
|
---|---|
Tipe Pembawa |
-
|
Edisi |
1st ed. 2005.
|
Subyek |
Algorithms.
COMPUTERS. Mathematical statistics. Computer science—Mathematics. Probabilities. Algorithm Analysis and Problem Complexity. Computation by Abstract Devices. Probability and Statistics in Computer Science. Discrete Mathematics in Computer Science. Probability Theory and Stochastic Processes. Algorithms. |
Info Detil Spesifik |
-
|
Pernyataan Tanggungjawab |
edited by Oleg B. Lupanov, Oktay M. Kasim-Zade, Alexander V. Chaskin, Kathleen Steinhöfel.
|
Informasi Lainnya
Anak judul |
Third International Symposium, SAGA 2005, Moscow, Russia, October 20-22, 2005
|
---|---|
Judul asli |
-
|
DOI/URL |
https://doi.org/10.1007/11571155
|
Versi lain/terkait
Tidak tersedia versi lain