834 search results - page 146 / 167 » Computing Minimal Models, Stable Models, and Answer Sets |
160
click to vote
MFCS
2010
Springer
14 years 10 months ago
2010
Springer
The problem of finding a satisfying assignment for a 2-SAT formula that minimizes the number of variables that are set to 1 (min ones 2–sat) is NP-complete. It generalizes the w...
101
click to vote
MP
2010
14 years 10 months ago
2010
Inspired by the One Laptop Per Child project, we consider mesh networks that connect devices that cannot recharge their batteries easily. We study how the mesh should retransmit in...
115
click to vote
WISE
2009
Springer
15 years 9 months ago
2009
Springer
ct One significant effort towards combining the virtues of Web search, viz. being accessible to untrained users and able to cope with vastly heterogeneous data, with those of dat...
147
click to vote
SIAMMAX
2010
14 years 6 months ago
2010
The problem of completing a low-rank matrix from a subset of its entries is often encountered in the analysis of incomplete data sets exhibiting an underlying factor model with app...
215
click to vote
ICDE
2009
IEEE
16 years 1 months ago
2009
IEEE
Abstract-- When dealing with massive quantities of data, topk queries are a powerful technique for returning only the k most relevant tuples for inspection, based on a scoring func...