6976 search results - page 202 / 1396 » The Oil Searching Problem |
171
click to vote
ATAL
2005
Springer
16 years 3 days ago
2005
Springer
We examine whether and how the Multiagent Plan Coordination Problem, the problem of resolving interactions between the plans of multiple agents, can be cast as a Distributed Const...
182
click to vote
GECCO
2009
Springer
15 years 11 months ago
2009
Springer
Given a collection of terminals, each with a demand, a collection of concentrators, each with a capacity, and costs of connecting the terminals to the concentrators, the terminal ...
200
click to vote
CSCLP
2006
Springer
15 years 10 months ago
2006
Springer
A number of different satisfaction and optimisation combinatorial problems have recently been approached with constraint programming over the domain of finite sets, for increased d...
153
click to vote
FSTTCS
2006
Springer
15 years 10 months ago
2006
Springer
The boundary labeling problem was recently introduced in [5] as a response to the problem of labeling dense point sets with large labels. In boundary labeling, we are given a recta...
170
click to vote
CSC
2008
15 years 8 months ago
2008
- The set-covering problem is an interesting problem in computational complexity theory. In [1], the setcovering problem has been proved to be NP hard and a greedy heuristic algori...