932 search results - page 148 / 187 » Analysis and Optimization of CHR Programs |
ICALP
2010
Springer
14 years 3 months ago
2010
Springer
Some of the currently best-known approximation algorithms for network design are based on random sampling. One of the key steps of such algorithms is connecting a set of source nod...
ICTAI
1999
IEEE
14 years 2 months ago
1999
IEEE
Recently, there has been much interest in enhancing purely combinatorial formalisms with numerical information. For example, planning formalisms can be enriched by taking resource...
ICALP
1997
Springer
14 years 2 months ago
1997
Springer
Despite the major role that modularity occupies in computer science, all the known results on modular analysis only treat particular problems, and there is no general unifying the...
ICDE
1993
IEEE
14 years 2 months ago
1993
IEEE
In this article, different techniques for 'pointer swizzling" are classified and evaluated for optimizing the access to main-memory resident persistent objects. To speed ...
ICALP
2010
Springer
14 years 11 days ago
2010
Springer
We present a new deterministic sorting algorithm that interleaves the partitioning of a sample sort with merging. Sequentially, it sorts n elements in O(n log n) time cache-oblivi...