887 search results - page 104 / 178 » A Time for Choosing |
IWMM
2004
Springer
14 years 3 months ago
2004
Springer
Heap size has a huge impact on the performance of garbage collected applications. A heap that barely meets the application’s needs causes excessive GC overhead, while a heap tha...
STACS
2004
Springer
14 years 3 months ago
2004
Springer
We present two simple algorithms for SAT and prove upper bounds on their running time. Given a Boolean formula F in conjunctive normal form, the first algorithm finds a satisfyin...
VLDB
2004
ACM
14 years 3 months ago
2004
ACM
Adaptive query processing schemes attempt to reoptimize query plans during the course of query execution. A variety of techniques for adaptive query processing have been proposed,...
XSYM
2004
Springer
14 years 3 months ago
2004
Springer
XML indices are essential for efficiently processing XML queries which typically have predicates on both structures and values. Since the number of all possible structural and val...
ICTAI
2003
IEEE
14 years 3 months ago
2003
IEEE
Local search-based methods of SAT solving have received a significant attention in the last decade. All local search-based methods choose the next truth assignment by flipping t...