1410 search results - page 15 / 282 » The Algorithmics of Solitaire-Like Games |
115
click to vote
SODA
2010
ACM
15 years 10 months ago
2010
ACM
The class of constraint satisfactions problems (CSPs) captures many fundamental combinatorial optimization problems such as Max Cut, Max q-Cut, Unique Games, and Max k-Sat. Recent...
102
click to vote
GECCO
2009
Springer
15 years 7 months ago
2009
Springer
We propose a variation of the standard genetic algorithm that incorporates social interaction between the individuals in the population. Our goal is to understand the evolutionary...
78
Voted
STOC
2000
ACM
15 years 5 months ago
2000
ACM
STOC
2001
ACM
16 years 28 days ago
2001
ACM
ERSHOV
2003
Springer
15 years 5 months ago
2003
Springer
We present several new algorithms as well as new lower and upper bounds for optimizing functions underlying infinite games pertinent to computer-aided verification.