193 search results - page 31 / 39 » Dynamical Properties of Answer Set Programs |
COMPGEOM
2003
ACM
15 years 3 months ago
2003
ACM
We develop cache-oblivious data structures for orthogonal range searching, the problem of finding all T points in a set of N points in Êd lying in a query hyper-rectangle. Cache...
103
click to vote
CIKM
2005
Springer
15 years 3 months ago
2005
Springer
In this paper, we propose a new strategy for optimizing the placement of bin boundaries to minimize the cost of query evaluation using bitmap indices with binning. For attributes ...
HICSS
2005
IEEE
15 years 4 months ago
2005
IEEE
As we progress, society must intelligently address the following question: How much risk is acceptable? How we answer this question could have important consequences for the futur...
111
click to vote
CC
2006
Springer
15 years 2 months ago
2006
Springer
Abstract. Profiling can effectively analyze program behavior and provide critical information for feedback-directed or dynamic optimizations. Based on memory profiling, reuse dista...
LFP
1992
14 years 11 months ago
1992
Tag handling accounts for a substantial amount of execution cost in latently typed languages such as Common LISP and Scheme, especially on architectures that provide no special ha...