Stop the war!
Остановите войну!
for scientists:
default search action
1. SAGA 2001: Berlin, Germany
- Kathleen Steinhöfel:
Stochastic Algorithms: Foundations and Applications, International Symposium, SAGA 2001 Berlin, Germany, December 13-14, 2001, Proceedings. Lecture Notes in Computer Science 2264, Springer 2001, ISBN 3-540-43025-3 - Juraj Hromkovic:
Randomized Communication Protocols (A Survey). 1-32 - Thilo Mahnig, Heinz Mühlenbein:
Optimal Mutation Rate Using Bayesian Priors for Estimation of Distribution Algorithms. 33-48 - Stephen Fitzpatrick, Lambert G. L. T. Meertens:
An Experimental Assessment of a Stochastic, Anytime, Decentralized, Soft Colourer for Sparse Graphs. 49-64 - Martin Sauerhoff:
Randomized Branching Programs. 65-72 - Philippe Codognet, Daniel Diaz:
Yet Another Local Search Method for Constraint Solving. 73-90 - Carlo Meloni:
An Evolutionary Algorithm for the Sequence Coordination in Furniture Production. 91-106 - Jan Poland, Kosmas Knödler, Alexander Mitterer, Thomas Fleischhauer, Frank Zuber-Goos, Andreas Zell:
Evolutionary Search for Smooth Maps in Motor Control Unit Calibration. 107-116 - Gregory B. Sorkin:
Some Notes on Random Satisfiability. 117-130 - Uwe Naumann, Peter Gottschling:
Prospects for Simulated Annealing Algorithms in Automatic Differentiation. 131-144 - Henning Behnke, Michael Kolonko, Ulrich Mertins, Stefan Schnitter:
Optimization and Simulation: Sequential Packing of Flexible Objects Using Evolutionary Algorithms. 145-154 - Thomas Zeugmann:
Stochastic Finite Learning. 155-172 - Ricard Gavaldà, Osamu Watanabe:
Sequential Sampling Algorithms: Unified Analysis and Lower Bounds. 173-188 - Peter Damaschke:
Approximate Location of Relevant Variables under the Crossover Distribution. 189-202
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.