16404 search results - page 205 / 3281 » A set coverage problem |
137
Voted
CADE
2009
Springer
16 years 4 months ago
2009
Springer
This paper is concerned with the problem of checking whether a given subset of an unsatisfiable Boolean CNF formula takes part in the basic causes of the inconsistency of . More ...
151
Voted
KR
2010
Springer
15 years 8 months ago
2010
Springer
Cardinality constraints or, more generally, weight constraints are well recognized as an important extension of answer-set programming. Clearly, all common algorithmic tasks relat...
104
Voted
ISSS
1996
IEEE
15 years 7 months ago
1996
IEEE
In this paper we investigate the problem of code generation for address computation for DSP processors. This work is divided into four parts. First, we propose a branch instructio...
135
Voted
ATVA
2006
Springer
15 years 7 months ago
2006
Springer
Ping-pong protocols with recursive definitions of agents, but without any active intruder, are a Turing powerful model. We show that under the environment sensitive semantics (i.e....
142
Voted
WWW
2009
ACM
16 years 4 months ago
2009
ACM
Comprehensive coverage of the public web is crucial to web search engines. Search engines use crawlers to retrieve pages and then discover new ones by extracting the pages' o...