705 search results - page 105 / 141 » Approximating Extended Answer Sets |
192
click to vote
ICLP
2009
Springer
15 years 10 months ago
2009
Springer
We extend to disjunctive logic programs our previous work on computing loop formulas of loops with at most one external support. We show that for these logic programs, loop formula...
HPDC
2007
IEEE
15 years 4 months ago
2007
IEEE
Desktop grids combine Peer-to-Peer and Grid computing techniques to improve the robustness, reliability and scalability of job execution infrastructures. However, efficiently mat...
FSTTCS
2007
Springer
15 years 3 months ago
2007
Springer
We study several cost coloring problems, where we are given a graph and a cost function on the independent sets and are to find a coloring that minimizes the function costs of the...
INFOCOM
2006
IEEE
15 years 3 months ago
2006
IEEE
— We focus on detecting intrusions in ad hoc networks using the misuse detection technique. We allow for detection modules that periodically fail to detect attacks and also gener...
COCOON
2010
Springer
15 years 1 months ago
2010
Springer
Given a set of n strings of length L and a radius d, the closest string problem (CSP for short) asks for a string tsol that is within a Hamming distance of d to each of the given ...