16666 search results - page 3275 / 3334 » Descriptive and Computational Complexity |
131
click to vote
IJCAI
1989
15 years 5 months ago
1989
This paper considers the Valiant framework as it is applied to the task of learning logical concepts from random examples. It is argued that the current interpretation of this Val...
145
Voted
IJCAI
1989
15 years 5 months ago
1989
gn problem can be abstractly characterized as a constrained function-to-structure mapping. The de sign task takes as input the specifications of the desired functions of a device...
152
Voted
ATAL
2010
Springer
15 years 5 months ago
2010
Springer
A central problem in artificial intelligence is to choose actions to maximize reward in a partially observable, uncertain environment. To do so, we must learn an accurate model of ...
142
click to vote
ATAL
2010
Springer
15 years 5 months ago
2010
Springer
There has been significant recent interest in game theoretic approaches to security, with much of the recent research focused on utilizing the leader-follower Stackelberg game mod...
131
Voted
ATAL
2010
Springer
15 years 5 months ago
2010
Springer
A major challenge for traditional approaches to multiagent learning is to train teams that easily scale to include additional agents. The problem is that such approaches typically...