1453 search results - page 197 / 291 » Partial Constraint Satisfaction |
120
click to vote
STOC
2006
ACM
16 years 6 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...
105
click to vote
ATAL
2005
Springer
15 years 5 months ago
2005
Springer
Methods for solving Distributed Constraint Optimization Problems (DCOP) have emerged as key techniques for distributed reasoning. Yet, their application faces significant hurdles...
102
click to vote
DSS
2008
14 years 11 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...
122
click to vote
PEPM
1993
ACM
15 years 4 months ago
1993
ACM
The aim of binding-time analysis is to determine when variables, expressions, statements, etc. in a program can be evaluated by classifying these into static (compile-time) and dy...
ACL
2010
14 years 10 months ago
2010
We show how web mark-up can be used to improve unsupervised dependency parsing. Starting from raw bracketings of four common HTML tags (anchors, bold, italics and underlines), we ...