466 search results - page 24 / 94 » Preprocessing Search Spaces for Branch and Bound Search |
101
click to vote
FOCS
2006
IEEE
15 years 5 months ago
2006
IEEE
We convert cell-probe lower bounds for polynomial space into stronger lower bounds for near-linear space. Our technique applies to any lower bound proved through the richness meth...
118
click to vote
ICALP
2003
Springer
15 years 5 months ago
2003
Springer
Although evolutionary algorithms (EAs) are widely used in practical optimization, their theoretical analysis is still in its infancy. Up to now results on the (expected) runtime ar...
VC
2008
14 years 11 months ago
2008
Animation authoring involves an author's interaction with a scene, resulting in varying scene complexity for a given animation sequence. In such a varying environment, detecti...
AI
2003
Springer
15 years 5 months ago
2003
Springer
The multi-processor total tardiness problem (MPTTP) is an ÆÈ-hard scheduling problem, in which the goal is to minimise the tardiness of a set of jobs that are processed on a numb...
3DIM
2003
IEEE
15 years 5 months ago
2003
IEEE
This paper describes a novel method which extends the search algorithm of a k-d tree for aligning and merging range images. If the nearest neighbor point is far from a query, many...