272 search results - page 47 / 55 » A Game-Theoretic Approach to Constraint Satisfaction |
117
click to vote
LATIN
2010
Springer
14 years 12 months ago
2010
Springer
A predicate P : {−1, 1}k → {0, 1} can be associated with a constraint satisfaction problem Max CSP(P). P is called “approximation resistant” if Max CSP(P) cannot be approxi...
110
click to vote
ATAL
2007
Springer
15 years 5 months ago
2007
Springer
Merging operators try to define the beliefs of a group of agents according to the beliefs of each member of the group. Several model-based propositional belief merging operators h...
101
click to vote
ATAL
2006
Springer
15 years 5 months ago
2006
Springer
Distributed Constraint Satisfaction Problems (DCSPs) provide a model to capture a broad range of cooperative multiagent problem solving settings. Researchers have generally propos...
135
click to vote
STOC
2006
ACM
16 years 1 months 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...
115
click to vote
DSS
2008
15 years 1 months 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...