2917 search results - page 230 / 584 » Satisfying Interaction Constraints |
214
click to vote
SCCC
2005
IEEE
16 years 10 days ago
2005
IEEE
Databases may not satisfy integrity constraints (ICs) for several reasons. Nevertheless, in most of the cases an important part of the data is still consistent wrt certain desired...
171
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...
167
click to vote
ATAL
2005
Springer
16 years 9 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
Voted
ICNC
2005
Springer
16 years 8 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...
134
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 ...