6976 search results - page 107 / 1396 » The Oil Searching Problem |
154
click to vote
DAM
2008
15 years 6 months ago
2008
Let G = (V, E) be a graph with vertex set V and edge set E. The k-coloring problem is to assign a color (a number chosen in {1, . . . , k}) to each vertex of G so that no edge has...
127
Voted
EOR
2006
15 years 6 months ago
2006
This paper deals with a multi-stage two-person zero-sum game called the multi-stage search allocation game (MSSAG), in which a searcher and an evader participate. The searcher dist...
170
click to vote
AIPS
2011
14 years 9 months ago
2011
We consider the problem of finding generalized plans for situations where the number of objects may be unknown and unbounded during planning. The input is a domain specification...
151
click to vote
AAAI
2008
15 years 8 months ago
2008
We present a breadth-first search algorithm, two-bit breadthfirst search (TBBFS), which requires only two bits for each state in the problem space. TBBFS can be parallelized in se...
170
click to vote
INFORMS
2007
15 years 6 months ago
2007
— We describe the development and testing of a metaheuristic procedure, based on the scatter search methodology, for the problem of approximating the efficient frontier of nonlin...