1983 search results - page 245 / 397 » Competitive graph searches |
STOC
2009
ACM
14 years 9 months ago
2009
ACM
Consider the edge-connectivity survivable network design problem: given a graph G = (V, E) with edge-costs, and edgeconnectivity requirements rij Z0 for every pair of vertices i,...
AI
2010
Springer
13 years 8 months ago
2010
Springer
Case-based planning can take advantage of former problem-solving experiences by storing in a plan library previously generated plans that can be reused to solve similar planning p...
WWW
2007
ACM
14 years 9 months ago
2007
ACM
A minimal perfect function maps a static set of keys on to the range of integers {0,1,2, ... , - 1}. We present a scalable high performance algorithm based on random graphs for ...
CIKM
2008
Springer
13 years 10 months ago
2008
Springer
As online social networking emerges, there has been increased interest to utilize the underlying social structure as well as the available social information to improve search. In...
CP
2007
Springer
14 years 2 months ago
2007
Springer
Searching for optimal solutions to a problem using lower bounds obtained from a relaxation is a common idea in Heuristic Search and Planning. In SAT and CSPs, however, explicit rel...