14386 search results - page 236 / 2878 » The Chinese Generals Problem |
156
click to vote
ESA
2001
Springer
15 years 9 months ago
2001
Springer
In this paper we describe a general grouping technique to devise faster and simpler approximation schemes for several scheduling problems. We illustrate the technique on two diff...
154
Voted
GECCO
2010
Springer
15 years 8 months ago
2010
Springer
We analyze various forms of the Frequency Assignment Problem using the theory of elementary landscapes. We show that three variants of the Frequency Assignment Problem are either ...
162
click to vote
COCOON
2004
Springer
15 years 8 months ago
2004
Springer
In this work, we study an extension of the k-center facility location problem, where centers are required to service a minimum of clients. This problem is motivated by requirement...
136
Voted
CORR
2007
Springer
15 years 4 months ago
2007
Springer
We present an exactly solvable random-subcube model inspired by the structure of hard constraint satisfaction and optimization problems. Our model reproduces the structure of the s...
131
click to vote
ECAI
2004
Springer
15 years 10 months ago
2004
Springer
Distributed constraint satisfaction, in its most general acceptation, involves a collection of agents solving local constraint satisfaction subproblems, and a communication protoco...