6976 search results - page 278 / 1396 » The Oil Searching Problem |
169
click to vote
LPAR
2005
Springer
16 years 5 days ago
2005
Springer
Local search algorithms are one of the effective methods for solving hard combinatorial problems. However, a serious problem of this approach is that the search often traps at loca...
188
click to vote
ATAL
2008
Springer
15 years 8 months ago
2008
Springer
When exploring a game over a large strategy space, it may not be feasible or cost-effective to evaluate the payoff of every relevant strategy profile. For example, determining a p...
175
click to vote
AIPS
2000
15 years 8 months ago
2000
The formulation of planning as heuristic search with heuristics derived from problem representations has turned out to be a fruitful approach for classical planning. In this paper...
154
click to vote
SODA
1998
ACM
15 years 8 months ago
1998
ACM
We consider the problem of implementing nger search trees on the pointer machine, i.e., how to maintain a sorted list such that searching for an element x, starting the search at ...
192
click to vote
HEURISTICS
2002
15 years 6 months ago
2002
In this paper, we present the parallelization of tabu search on a network of workstations using PVM. Two parallelization strategies are integrated: functional decomposition strate...