477 search results - page 95 / 96 » Complexity Considerations, cSAT Problem Lower Bound |
111
click to vote
STOC
1994
ACM
15 years 5 months ago
1994
ACM
We present new results on the well-studied problem of learning DNF expressions. We prove that an algorithm due to Kushilevitz and Mansour [13] can be used to weakly learn DNF form...
124
click to vote
ALT
1995
Springer
15 years 4 months ago
1995
Springer
This paper characterizes the polynomial time learnability of TPk, the class of collections of at most k rst-order terms. A collection in TPk de nes the union of the languages de n...
111
click to vote
ATAL
2008
Springer
15 years 3 months ago
2008
Springer
Many multiagent domains where cooperation among agents is crucial to achieving a common goal can be modeled as coalitional games. However, in many of these domains, agents are une...
AMAI
2008
Springer
15 years 1 months ago
2008
Springer
We study distributed boundary coverage of known environments using a team of miniature robots. Distributed boundary coverage is an instance of the multi-robot task-allocation prob...
113
click to vote
CORR
2010
Springer
15 years 1 months ago
2010
Springer
We present several new examples of speed-ups obtainable by quantum algorithms in the context of property testing. First, motivated by sampling algorithms, we consider probability d...