80 search results - page 11 / 16 » Cube Pruning as Heuristic Search |
AAAI
1990
14 years 11 months ago
1990
Bandwidth is a fundamental concept in graph theory which has some surprising applications to a class of AI search problems. Graph bandwidth provides a link between the syntactic s...
CIKM
1999
Springer
15 years 2 months ago
1999
Springer
We present the architecture and a performance assessment of an extensible query optimizer written in Venus. Venus is a general-purpose active-database rule language embedded in C+...
EDBT
2010
ACM
14 years 11 months ago
2010
ACM
One of the most challenging tasks for the database administrator is to physically design the database to attain optimal performance for a given workload. Physical design is hard b...
109
click to vote
ECAI
2010
Springer
14 years 10 months ago
2010
Springer
Symmetry is an important feature of many constraint programs. We show that any symmetry acting on a set of symmetry breaking constraints can be used to break symmetry. Different s...
BMCBI
2008
14 years 9 months ago
2008
Background: Inference of evolutionary trees using the maximum likelihood principle is NP-hard. Therefore, all practical methods rely on heuristics. The topological transformations...