1461 search results - page 66 / 293 » The Cost of Cache-Oblivious Searching |
122
click to vote
ATAL
2008
Springer
15 years 1 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...
AIPS
2000
15 years 1 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...
GIS
2002
ACM
14 years 11 months ago
2002
ACM
This papers deals with multiway spatial joins when (i) there is limited time for query processing and the goal is to retrieve the best possible solutions within this limit (ii) the...
108
click to vote
HEURISTICS
2002
14 years 11 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...
TC
2010
14 years 10 months ago
2010
—A dynamic multiway segment tree (DMST) is proposed for IP lookups in this paper. DMST is designed for dynamic routing tables that can dynamically insert and delete prefixes. DMS...