9842 search results - page 213 / 1969 » Problem complexity |
159
click to vote
CP
2005
Springer
15 years 12 months ago
2005
Springer
Many problems of theoretical and practical interest can be formulated as Constraint Satisfaction Problems (CSPs). The general CSP is known to be NP-complete; however, distributed m...
149
click to vote
FOCS
2003
IEEE
15 years 11 months ago
2003
IEEE
We show that if an NP-complete problem has a non-adaptive self-corrector with respect to a samplable distribution then coNP is contained in NP/poly and the polynomial hierarchy co...
170
click to vote
MATES
2005
Springer
15 years 12 months ago
2005
Springer
Abstract. Cooperative problem solving without communication is an oftenstudied field within multi-agent research. Realistic problems investigated in this particular field are compl...
164
click to vote
ATAL
2006
Springer
15 years 10 months ago
2006
Springer
In this paper we produce complexity and impossibility results and develop algorithms for a task allocation problem that needs to be solved by a group of autonomous agents working ...
181
click to vote
ICMLA
2004
15 years 7 months ago
2004
Complexity, or in other words compactness, of models generated by rule learners is one of often neglected issues, although it has a profound effect on the success of any project t...