14774 search results - page 479 / 2955 » Computational complexity and evolutionary computation |
201
Voted
SAGT
2010
Springer
15 years 5 months ago
2010
Springer
We consider the computational complexity of coalitional solution concepts in scenarios related to load balancing such as anonymous and congestion games. In congestion games, Paret...
179
Voted
AMC
2007
15 years 7 months ago
2007
: Average case analysis forms an interesting and intriguing part of algorithm theory since it explains why some algorithms with bad worst-case complexity can better themselves in p...
162
click to vote
MFCS
2010
Springer
15 years 5 months ago
2010
Springer
For a finite set Γ of Boolean relations, Max Ones SAT(Γ) and Exact Ones SAT(Γ) are generalized satisfiability problems where every constraint relation is from Γ, and the task...
181
click to vote
CCCG
2009
15 years 4 months ago
2009
Motivated by the question of the polytopal realizability of the simplicial complex n,k of (k + 1)-crossing-free sets of diagonals of the convex n-gon, we study the first open case...
220
Voted
LION
2009
Springer
16 years 1 months ago
2009
Springer
The fitness landscape of the resource constrained project scheduling problem is investigated by examining the search space position type distribution and the correlation between t...