Search Sciweavers | Sciweavers

17

WDAG
2007
Springer

79views Algorithms» more WDAG 2007»

A Simple Population Protocol for Fast Robust Approximate Majority

14 years 1 months ago

We describe and analyze a 3-state one-way population protocol to compute approximate majority in the model in which pairs of agents are drawn uniformly at random to interact. Given...

Dana Angluin, James Aspnes, David Eisenstat

claim paper

Read More »

26

click to vote

DAGSTUHL
2006

137views Software Engineering» more DAGSTUHL 2006»

How fast does the stationary distribution of the Markov chain modelling EAs concentrate on the homogeneous populations for small

13 years 9 months ago

Download drops.dagstuhl.de

One of the main difficulties faced when analyzing Markov chains modelling evolutionary algorithms is that their cardinality grows quite fast. A reasonable way to deal with this iss...

Boris Mitavskiy, Jonathan E. Rowe

claim paper

Read More »

19

click to vote

EVOW
2006
Springer

119views Artificial Intelligence» more EVOW 2006»

Fast EAX Algorithm Considering Population Diversity for Traveling Salesman Problems

13 years 11 months ago

Download www.ie.metu.edu.tr

This paper proposes an evolutionary algorithm (EA) that is applied to the traveling salesman problem (TSP). Existing approximation methods to address the TSP known to be state-of-t...

Yuichi Nagata

claim paper

Read More »

24

click to vote

BIOINFORMATICS
2012

212views Distributed And Parallel Com...» more BIOINFORMATICS 2012»

Fast stochastic algorithm for simulating evolutionary population dynamics

11 years 10 months ago

Download biodynamics.ucsd.edu

William H. Mather, Jeff Hasty, Lev S. Tsimring

claim paper