466 search results - page 79 / 94 » Preprocessing Search Spaces for Branch and Bound Search |
GECCO
2008
Springer
14 years 10 months ago
2008
Springer
Legged robots are useful in tasks such as search and rescue because they can effectively navigate on rugged terrain. However, it is difficult to design controllers for them that ...
83
Voted
FOCS
2000
IEEE
15 years 1 months ago
2000
IEEE
There is an upsurging interest in designing succinct data structures for basic searching problems (see [23] and references therein). The motivation has to be found in the exponent...
INFOCOM
1998
IEEE
15 years 1 months ago
1998
IEEE
We consider the problem of constructing logical topologies over a wavelength-routed optical network with no wavelength changers. We present a general linear formulation which consi...
82
Voted
VLDB
1997
ACM
15 years 1 months ago
1997
ACM
Query optimizers that explore a search space exhaustively using transformation rules usually apply all possible rules on each alternative, and stop when no new information is prod...
VLDB
1994
ACM
15 years 1 months ago
1994
ACM
We propose a new R-tree structure that outperforms all the older ones. The heart of the idea is to facilitate the deferred splitting approach in R-trees. This is done by proposing...