466 search results - page 71 / 94 » Preprocessing Search Spaces for Branch and Bound Search |
283
click to vote
CP
2009
Springer
16 years 6 months ago
2009
Springer
When interval methods handle systems of equations over the reals, two main types of filtering/contraction algorithms are used to reduce the search space. When the system is well-co...
181
click to vote
WIDM
2004
ACM
15 years 11 months ago
2004
ACM
In this paper, we propose a novel compact tree (Ctree) for XML indexing, which provides not only concise path summaries at the group level but also detailed child-parent links at ...
153
click to vote
GECCO
2003
Springer
15 years 11 months ago
2003
Springer
In this paper, we revisit a general class of multi-criteria multi-constrained network design problems and attempt to solve, in a novel way, with Evolutionary Algorithms (EAs). A ma...
140
click to vote
SAC
2009
ACM
16 years 24 days ago
2009
ACM
The molecular distance geometry problem can be formulated as the problem of finding an immersion in R3 of a given undirected, nonnegatively weighted graph G. In this paper, we di...
153
click to vote
EDBT
2008
ACM
16 years 6 months ago
2008
ACM
Enterprises may have multiple database systems spread across the organization for redundancy or for serving different applications. In such systems, query workloads can be distrib...