124 search results - page 14 / 25 » Using Available Memory to Transform Graphplan's Search |
CPHYSICS
2006
14 years 10 months ago
2006
A new stochastic method for locating the global minimum of a multidimensional function inside a rectangular hyperbox is presented. A sampling technique is employed that makes use ...
106
click to vote
DKE
2007
14 years 10 months ago
2007
The challenge in a database of evolving time series is to provide efficient algorithms and access methods for query processing, taking into consideration the fact that the databas...
AI
2006
Springer
14 years 10 months ago
2006
Springer
Branch-and-bound and branch-and-cut use search trees to identify optimal solutions to combinatorial optimization problems. In this paper, we introduce an iterative search strategy...
CIKM
2009
Springer
15 years 2 months ago
2009
Springer
A suffix tree is a fundamental data structure for string searching algorithms. Unfortunately, when it comes to the use of suffix trees in real-life applications, the current metho...
101
click to vote
AFP
2008
Springer
15 years 4 months ago
2008
Springer
This practical tutorial introduces the features available in Haskell for writing parallel and concurrent programs. We first describe how to write semi-explicit parallel programs b...