1983 search results - page 25 / 397 » Competitive graph searches |
AAAI
2004
13 years 9 months ago
2004
We consider how to use external memory, such as disk storage, to improve the scalability of heuristic search in statespace graphs. To limit the number of slow disk I/O operations,...
SODA
2010
ACM
14 years 5 months ago
2010
ACM
Searching for a point in the plane is a well-known search game problem introduced in the early eigthies. The best known search strategy is given by a spiral and achieves a competi...
SIGECOM
2009
ACM
14 years 2 months ago
2009
ACM
We consider the problem of a search engine trying to assign a sequence of search keywords to a set of competing bidders, each with a daily spending limit. The goal is to maximize ...
ICML
2010
IEEE
13 years 8 months ago
2010
IEEE
We introduce a novel graph kernel called the Neighborhood Subgraph Pairwise Distance Kernel. The kernel decomposes a graph into all pairs of neighborhood subgraphs of small radius...
SWAT
1994
Springer
13 years 11 months ago
1994
Springer
We give linear-time algorithms for a class of parametric search problems on weighted graphs of bounded tree-width. We also discuss the implications of our results to approximate p...