648 search results - page 80 / 130 » Using Criticalities as a Heuristic for Answer Set Programmin... |
167
click to vote
ICDE
2006
IEEE
16 years 12 days ago
2006
IEEE
Graphs have become popular for modeling structured data. As a result, graph queries are becoming common and graph indexing has come to play an essential role in query processing. ...
AAAI
2008
15 years 1 months ago
2008
Lifted inference algorithms exploit repeated structure in probabilistic models to answer queries efficiently. Previous work such as de Salvo Braz et al.'s first-order variabl...
141
click to vote
ICDE
2011
IEEE
14 years 2 months ago
2011
IEEE
— In this paper, we study the problem of efficiently computing multiple aggregation queries over a data stream. In order to share computation, prior proposals have suggested ins...
84
Voted
SAC
2004
ACM
15 years 4 months ago
2004
ACM
It is increasingly important to optimally select base stations in the design of cellular networks, as customers demand cheaper and better wireless services. From a set of potentia...
ICCAD
1999
IEEE
15 years 3 months ago
1999
IEEE
We present optimal solutions to the test scheduling problem for core-based systems. We show that test scheduling is equivalent to the m-processor open-shop scheduling problem and ...