466 search results - page 14 / 94 » Preprocessing Search Spaces for Branch and Bound Search |
AAAI
2008
14 years 11 months ago
2008
Hybrid Scheduling Problems (HSPs) contain both temporal and finite-domain variables, as well as constraints between them. A hybrid constraint over temporal and finite-domain varia...
JUCS
2008
14 years 9 months ago
2008
: Web searching techniques have been investigated and implemented in many aspects. Particularly, in case of personalization, more important issue is how to manipulate the results r...
IBPRIA
2007
Springer
15 years 3 months ago
2007
Springer
Some fast nearest neighbor search (NNS) algorithms using metric properties have appeared in the last years for reducing computational cost. Depending on the structure used to store...
SPAA
1990
ACM
15 years 1 months ago
1990
ACM
Fractional cascading is a technique designed to allow e cient sequential search in a graph with catalogs of total size n. The search consists of locating a key in the catalogs alo...
VIS
2009
IEEE
15 years 10 months ago
2009
IEEE
We develop a new algorithm for isosurface extraction and view-dependent filtering from large time-varying fields, by using a novel Persistent Time-Octree (PTOT) indexing structure....