942 search results - page 152 / 189 » Distance Constraint Satisfaction Problems |
100
click to vote
ATAL
2003
Springer
15 years 5 months ago
2003
Springer
In this paper we present a cooperative negotiation protocol that solves a distributed resource allocation problem while conforming to soft real-time constraints in a dynamic envir...
127
click to vote
STOC
2006
ACM
16 years 28 days ago
2006
ACM
The PCP theorem [3, 2] says that every language in NP has a witness format that can be checked probabilistically by reading only a constant number of bits from the proof. The cele...
110
Voted
DSS
2008
15 years 5 days ago
2008
The Web is a universal repository of human knowledge and culture which has allowed unprecedented sharing of ideas and information in a scale never seen before. It can also be cons...
106
Voted
ICML
2007
IEEE
16 years 1 months ago
2007
IEEE
Inference tasks in Markov random fields (MRFs) are closely related to the constraint satisfaction problem (CSP) and its soft generalizations. In particular, MAP inference in MRF i...
92
Voted
SETN
2004
Springer
15 years 6 months ago
2004
Springer
Abstract. In order to obtain a solution to a constraint satisfaction problem, constructive methods iteratively extend a consistent partial assignment until all problem variables ar...