1639 search results - page 283 / 328 » Anytime Heuristic Search |
CIKM
2006
Springer
14 years 12 days ago
2006
Springer
We study the novel problem of efficiently computing the update distance for a pair of relational databases. In analogy to the edit distance of strings, we define the update distan...
CP
2006
Springer
14 years 12 days ago
2006
Springer
The max k-armed bandit problem is a recently-introduced online optimization problem with practical applications to heuristic search. Given a set of k slot machines, each yielding p...
DAWAK
2006
Springer
14 years 11 days ago
2006
Springer
We consider the problem of concurrent execution of multiple frequent itemset queries. If such data mining queries operate on overlapping parts of the database, then their overall I...
GECCO
2006
Springer
14 years 10 days ago
2006
Springer
In the realm of data mining, several key issues exists in the traditional classification algorithms, such as low readability, large rule number, and low accuracy with information ...
GECCO
2006
Springer
14 years 10 days ago
2006
Springer
This paper proposes an adaptive discretization method, called Split-on-Demand (SoD), to enable the probabilistic model building genetic algorithm (PMBGA) to solve optimization pro...