4117 search results - page 297 / 824 » On the Satisfiability of Complex Constraints |
173
click to vote
SIGIR
2005
ACM
16 years 10 days ago
2005
ACM
Existing retrieval models generally do not offer any guarantee for optimal retrieval performance. Indeed, it is even difficult, if not impossible, to predict a model’s empirica...
168
click to vote
ATAL
2005
Springer
16 years 10 days ago
2005
Springer
We introduce the Multiagent Agreement Problem (MAP) to represent a class of multiagent scheduling problems. MAP is based on the Distributed Constraint Reasoning (DCR) paradigm and...
145
click to vote
ICNC
2005
Springer
16 years 9 days ago
2005
Springer
Abstract. In this paper we propose a procedure for the storage and retrieval of digital signals utilizing DNA. Digital signals are encoded in DNA sequences that satisfy among other...
135
click to vote
ICALP
2010
Springer
15 years 11 months ago
2010
Springer
Min Ones Constraint Satisfaction Problems, i.e., the task of finding a satisfying assignment with at most k true variables (Min Ones SAT(Γ)), can express a number of interesting ...
154
click to vote
SAS
1999
Springer
15 years 11 months ago
1999
Springer
This paper describes a powerful method for dead code analysis and elimination in the presence of recursive data constructions. We describe partially dead recursive data using live...