Sciweavers

942 search results - page 152 / 189
» Distance Constraint Satisfaction Problems
Sort
View
ATAL
2003
Springer
14 years 4 months ago
Cooperative negotiation for soft real-time distributed resource allocation
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...
Roger Mailler, Victor R. Lesser, Bryan Horling
STOC
2006
ACM
138views Algorithms» more  STOC 2006»
14 years 11 months ago
The PCP theorem by gap amplification
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...
Irit Dinur
DSS
2008
127views more  DSS 2008»
13 years 10 months ago
Cross-lingual thesaurus for multilingual knowledge management
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...
Christopher C. Yang, Chih-Ping Wei, K. W. Li
ICML
2007
IEEE
14 years 11 months ago
What is decreased by the max-sum arc consistency algorithm?
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...
Tomás Werner
SETN
2004
Springer
14 years 4 months ago
Construction and Repair: A Hybrid Approach to Search in CSPs
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...
Konstantinos Chatzikokolakis, George Boukeas, Pana...