2233 search results - page 429 / 447 » On the Complexity of Theory Curbing |
103
click to vote
ATAL
2006
Springer
15 years 5 months ago
2006
Springer
In this paper we incorporate autonomous agents' capability to perform parallel interactions into the cooperative search model, resulting in a new method which outperforms the...
108
Voted
ATAL
2006
Springer
15 years 5 months ago
2006
Springer
Distributed Partially Observable Markov Decision Problems (Distributed POMDPs) are evolving as a popular approach for modeling multiagent systems, and many different algorithms ha...
139
click to vote
CASC
2006
Springer
15 years 5 months ago
2006
Springer
We address various aspects of our computer algebra-based computer logic system redlog. There are numerous examples in the literature for successful applications of redlog to practi...
131
click to vote
COLT
2006
Springer
15 years 5 months ago
2006
Springer
We describe a new approach for understanding the difficulty of designing efficient learning algorithms. We prove that the existence of an efficient learning algorithm for a circui...
129
click to vote
ALT
1995
Springer
15 years 5 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...