351 search results - page 6 / 71 » Perfect Constraints Are Tractable |
117
click to vote
AAAI
2012
13 years 2 months ago
2012
Novel tractable classes of the binary CSP (constraint satisfaction problem) have recently been discovered by studying classes of instances defined by excluding subproblems descri...
97
Voted
COGSCI
2008
14 years 11 months ago
2008
The recognition that human minds/brains are finite systems with limited resources for computation has led some researchers to advance the Tractable Cognition thesis: Human cogniti...
148
click to vote
FOCS
2002
IEEE
15 years 4 months ago
2002
IEEE
The Constraint Satisfaction Problem (CSP) provides a common framework for many combinatorial problems. The general CSP is known to be NP-complete; however, certain restrictions on...
DLOG
2009
15 years 22 days ago
2009
Abstract. We present a family of expressive extensions of Datalog, called Datalog
108
click to vote
CORR
2007
Springer
14 years 11 months ago
2007
Springer
—In distributed detection systems with wireless sensor networks, the communication between sensors and a fusion center is not perfect due to interference and limited transmitter ...