466 search results - page 26 / 94 » Preprocessing Search Spaces for Branch and Bound Search |
GEM
2007
15 years 1 months ago
2007
We present a method for searching for achordal open paths (snakes) in n-dimensional hypercube graphs (the box). Our technique first obtains a set of exemplary snakes using an evo...
COR
2010
14 years 12 months ago
2010
In this paper we propose a new hybrid heuristic for solving 0-1 mixed integer programs based on the principle of variable neighbourhood decomposition search. It combines variable ...
101
click to vote
AIPS
2009
15 years 27 days ago
2009
PDDL2.1 supports modelling of complex temporal planning domains in which solutions must exploit concurrency. Few existing temporal planners can solve problems that require concurr...
130
click to vote
ICDE
2012
IEEE
13 years 2 months ago
2012
IEEE
—Dimensionality reduction is essential in text mining since the dimensionality of text documents could easily reach several tens of thousands. Most recent efforts on dimensionali...
111
click to vote
CVPR
2008
IEEE
16 years 1 months ago
2008
IEEE
We present a motion estimation algorithm for multicamera systems consisting of more than one calibrated camera securely attached on a moving object. So, they move all together, bu...