Sciweavers

5138 search results - page 751 / 1028
» Randomized Algorithms for 3-SAT
Sort
View
ESOA
2006
15 years 10 months ago
Greedy Cheating Liars and the Fools Who Believe Them
Evolutionary algorithms based on "tags" can be adapted to induce cooperation in selfish environments such as peer-to-peer systems. In this approach, nodes periodically co...
Stefano Arteconi, David Hales, Özalp Babaoglu
GECCO
2006
Springer
133views Optimization» more  GECCO 2006»
15 years 10 months ago
Selecting for evolvable representations
Evolutionary algorithms tend to produce solutions that are not evolvable: Although current fitness may be high, further search is impeded as the effects of mutation and crossover ...
Joseph Reisinger, Risto Miikkulainen
COMPGEOM
2001
ACM
15 years 10 months ago
Discrete mobile centers
We propose a new randomized algorithm for maintaining a set of clusters among moving nodes in the plane. Given a specified cluster radius, our algorithm selects and maintains a va...
Jie Gao, Leonidas J. Guibas, John Hershberger, Li ...
TACAS
2000
Springer
138views Algorithms» more  TACAS 2000»
15 years 10 months ago
Symbolic Model Checking of Probabilistic Processes Using MTBDDs and the Kronecker Representation
This paper reports on experimental results with symbolic model checking of probabilistic processes based on Multi-Terminal Binary Decision Diagrams (MTBDDs). We consider concurrent...
Luca de Alfaro, Marta Z. Kwiatkowska, Gethin Norma...
ISTCS
1995
Springer
15 years 10 months ago
Computation of Highly Regular Nearby Points
We call a vector x 2 IRn highly regular if it satis es < x m >= 0 for some short, non{zero integer vector m where < : : > is the inner product. We present an algorithm...
Carsten Rössner, Claus-Peter Schnorr