4860 search results - page 157 / 972 » SNPs Problems, Complexity, and Algorithms |
SMA
2005
ACM
14 years 3 months ago
2005
ACM
Nef polyhedra in d-dimensional space are the closure of half-spaces under boolean set operation. In consequence, they can represent non-manifold situations, open and closed sets, ...
COCO
2005
Springer
14 years 3 months ago
2005
Springer
We study the complexity of solving succinct zero-sum games, i.e., the games whose payoff matrix M is given implicitly by a Boolean circuit C such that M(i, j) = C(i, j). We comple...
COR
2008
13 years 9 months ago
2008
We consider the problem of ranking assignments according to cost in the classical linear assignment problem. An algorithm partitioning the set of possible assignments, as suggeste...
GECCO
2006
Springer
14 years 1 months ago
2006
Springer
This paper uses an entertaining student "sports" game to illustrate that GAs can be adapted to problems with uncertain properties and complexity. These problems can be s...
INFOSCALE
2007
ACM
13 years 11 months ago
2007
ACM
Problem localization is a critical part of providing crucial system management capabilities to modern distributed environments. One key open challenge is for problem localization ...