Sciweavers

37 search results - page 5 / 8
» Adaptive Lookahead for Answer Set Computation
Sort
View
IPPS
1997
IEEE
13 years 11 months ago
d-Dimensional Range Search on Multicomputers
The range tree is a fundamental data structure for multidimensional point sets, and as such, is central in a wide range of geometric anddatabaseapplications. Inthis paper, we desc...
Afonso Ferreira, Claire Kenyon, Andrew Rau-Chaplin...
COMPUTER
2000
128views more  COMPUTER 2000»
13 years 7 months ago
What's Ahead for Embedded Software?
hysical world. How do you adapt software abstractions designed merely to transform data to meet requirements like real-time constraints, concurrency, and stringent safety considera...
Edward A. Lee
CIDR
2003
150views Algorithms» more  CIDR 2003»
13 years 8 months ago
The Database Machine: Old Story, New Slant?
Current database management system technology is not well equipped to provide adequate support for what has been deemed the 3rd wave of computing -- Ubiquitous Computing. Such app...
Julie A. McCann
CPAIOR
2009
Springer
14 years 2 months ago
Solution Enumeration for Projected Boolean Search Problems
Many real-world problems require the enumeration of all solutions of combinatorial search problems, even though this is often infeasible in practice. However, not always all parts ...
Martin Gebser, Benjamin Kaufmann, Torsten Schaub
VLDB
2007
ACM
181views Database» more  VLDB 2007»
14 years 7 months ago
STAR: Self-Tuning Aggregation for Scalable Monitoring
We present STAR, a self-tuning algorithm that adaptively sets numeric precision constraints to accurately and efficiently answer continuous aggregate queries over distributed data...
Navendu Jain, Michael Dahlin, Yin Zhang, Dmitry Ki...