


default search action
3. SAGA 2005: Moscow, Russia
- Oleg B. Lupanov, Oktay M. Kasim-Zade, Alexander V. Chaskin, Kathleen Steinhöfel:

Stochastic Algorithms: Foundations and Applications, Third International Symposium, SAGA 2005, Moscow, Russia, October 20-22, 2005, Proceedings. Lecture Notes in Computer Science 3777, Springer 2005, ISBN 3-540-29498-8 - Alexander A. Sapozhenko:

Systems of Containers and Enumeration Problems. 1-13 - Osamu Watanabe:

Some Heuristic Analysis of Local Search Algorithms for SAT Problems. 14-25 - Anatoli Manita

, François Simonot:
Clustering in Stochastic Asynchronous Algorithms for Distributed Simulations. 26-37 - Mikhail Ju. Moshkov:

On Construction of the Set of Irreducible Partial Covers. 38-44 - Christos D. Zaroliagis

:
Recent Advances in Multiobjective Optimization. 45-47 - Roman Kolpakov

:
Polynomial Time Checking for Generation of Finite Distributions of Rational Probabilities. 48-57 - Jan Poland:

FPL Analysis for Adaptive Bandits. 58-69 - Yu-Liang Wu, Chi-Kong Chan:

On Improved Least Flexibility First Heuristics Superior for Packing and Stock Cutting Problems. 70-81 - Joachim Wegener:

Evolutionary Testing Techniques. 82-94 - Hadi Nobahari, Seid H. Pourtakdoust

:
Optimal Fuzzy CLOS Guidance Law Design Using Ant Colony Optimization. 95-106 - Elizaveta A. Okol'nishnikova:

On Some Bounds on the Size of Branching Programs (A Survey). 107-115 - Walter J. Gutjahr

:
Two Metaheuristics for Multiobjective Stochastic Combinatorial Optimization. 116-125 - Chrystopher L. Nehaniv

:
Self-replication, Evolvability and Asynchronicity in Stochastic Worlds. 126-169 - Chi Seong Park, Mun-Kyu Lee, Dong Kyue Kim:

New Computation Paradigm for Modular Exponentiation Using a Graph Model. 170-179 - Martin Romauch, Richard F. Hartl

:
Dynamic Facility Location with Stochastic Demands. 180-189 - Farid M. Ablayev

:
The Complexity of Classical and Quantum Branching Programs: A Communication Complexity Approach. 190-201 - Alexey D. Yashunsky

:
On the Properties of Asymptotic Probability for Random Boolean Expression Values in Binary Bases. 202-212 - Reza Tavakkoli-Moghaddam

, Nima Safaei, Masoud Babakhani:
Solving a Dynamic Cell Formation Problem with Machine Cost and Alternative Process Plan by Memetic Algorithms. 213-227 - Adrian-Horia Dediu

, María Adela Grando
:
Eco-Grammar Systems as Models for Parallel Evolutionary Algorithms. 228-238

manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.


Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID














