648 search results - page 31 / 130 » Using Criticalities as a Heuristic for Answer Set Programmin... |
108
click to vote
SIGMOD
1999
ACM
15 years 5 months ago
1999
ACM
In large data warehousing environments, it is often advantageous to provide fast, approximate answers to complex aggregate queries based on statistical summaries of the full data....
ISCA
2005
IEEE
15 years 7 months ago
2005
IEEE
We propose “secret-protected (SP)” architecture to enable secure and convenient protection of critical secrets for a given user in an on-line environment. Keys are examples of...
117
click to vote
TON
2012
13 years 3 months ago
2012
—Society relies heavily on its networked physical infrastructure and information systems. Accurately assessing the vulnerability of these systems against disruptive events is vit...
AIR
2004
15 years 1 months ago
2004
Abstract. In this work we study an over-constrained scheduling problem where constraints cannot be relaxed. This problem originates from a local defense agency where activities to ...
CCGRID
2007
IEEE
15 years 7 months ago
2007
IEEE
Query-load (forwarding and answering) balancing in structured overlays is one of the most critical and least studied problems. It has been assumed that caching heuristics can take...