808 search results - page 115 / 162 » A scaling algorithm for polynomial constraint satisfaction p... |
81
Voted
AAAI
1998
15 years 1 months ago
1998
Wedefine an algebra of ternary relations for cyclic ordering of 2Dorientations. Thealgebra (1) is a refinement of the CYCORDtheory; (2) contains 24 atomic relations, hence 224 gen...
CORR
2010
Springer
15 years 20 days ago
2010
Springer
The problem of learning forest-structured discrete graphical models from i.i.d. samples is considered. An algorithm based on pruning of the Chow-Liu tree through adaptive threshol...
82
Voted
AAAI
1998
15 years 1 months ago
1998
A key assumption of all problem-solving approaches based on utility theory, including heuristic search, is that we can assign a utility or cost to each state. This in turn require...
101
click to vote
STOC
2009
ACM
16 years 1 months ago
2009
ACM
In this paper we study a fundamental open problem in the area of probabilistic checkable proofs: What is the smallest s such that NP naPCP1,s[O(log n), 3]? In the language of har...
119
Voted
AAAI
2007
15 years 2 months ago
2007
In many sensing applications we must continuously gather information to provide a good estimate of the state of the environment at every point in time. A robot may tour an environ...