13987 search results - page 291 / 2798 » The Two Guards Problem |
171
click to vote
SECON
2007
IEEE
16 years 29 days ago
2007
IEEE
— The coverage and connectivity problem in sensor networks has received significant attention of the research community in the recent years. In this paper, we study this problem...
207
click to vote
FOCS
2006
IEEE
16 years 23 days ago
2006
IEEE
Combinatorial allocation problems require allocating items to players in a way that maximizes the total utility. Two such problems received attention recently, and were addressed ...
173
click to vote
FCT
2005
Springer
16 years 6 days ago
2005
Springer
Usually, for bin packing problems, we try to minimize the number of bins used or in the case of the dual bin packing problem, maximize the number or total size of accepted items. ...
218
click to vote
AAAI
1994
15 years 8 months ago
1994
Many AI problems can be modeled as constraint satisfaction problems (CSP), but many of them are actually dynamic: the set of constraints to consider evolves because of the environ...
177
click to vote
CEC
2010
IEEE
15 years 7 months ago
2010
IEEE
In this paper we present a simple and general new No Free Lunch-like result that applies to revisiting algorithms searching arbitrary problem sets. We begin by unifying the assumpt...