5316 search results - page 3 / 1064 » Which Search Problems Are Random |
PRICAI
2004
Springer
13 years 11 months ago
2004
Springer
Temporal reasoning is an important task in many areas of computer science including planning, scheduling, temporal databases and instruction optimisation for compilers. Given a kno...
APPROX
2008
Springer
13 years 7 months ago
2008
Springer
We study the problem of local search on a graph. Given a real-valued black-box function f on the graph's vertices, this is the problem of determining a local minimum of f--a v...
EOR
2007
13 years 5 months ago
2007
This article addresses an extension of the multi-depot vehicle routing problem in which vehicles may be replenished at intermediate depots along their route. It proposes a heurist...
AI
2001
Springer
13 years 10 months ago
2001
Springer
In fast-paced software projects, engineers don’t have the time or the resources to build heavyweight complete descriptions of their software. The best they can do is lightweight ...
IFL
1997
Springer
13 years 10 months ago
1997
Springer
Functional programs, by nature, operate on functional, or persistent, data structures. Therefore, persistent graphs are a prerequisite to express functional graph algorithms. In th...