4229 search results - page 800 / 846 » On the Optimality of Spiral Search |
CCO
2001
Springer
15 years 3 months ago
2001
Springer
Branch, cut, and price (BCP) is an LP-based branch and bound technique for solving large-scale discrete optimization problems (DOPs). In BCP, both cuts and variables can be generat...
FOCS
2000
IEEE
15 years 3 months ago
2000
IEEE
We present dynamic search-tree data structures that perform well in the setting of a hierarchical memory (including various levels of cache, disk, etc.), but do not depend on the ...
DATE
1999
IEEE
15 years 3 months ago
1999
IEEE
Software programming languages, such as C/C++, have been used as means for specifying hardware for quite a while. Different design methodologies have exploited the advantages of f...
HPCA
1999
IEEE
15 years 3 months ago
1999
IEEE
Researchers have searched for scalable alternatives to the symmetric multiprocessor (SMP) architecture since it was first introduced in 1982. This paper introduces an alternative ...
CIKM
1999
Springer
15 years 3 months ago
1999
Springer
On-line analytical processing (OLAP) requires e cient processing of complex decision support queries over very large databases. It is well accepted that pre-computed data cubes ca...