1756 search results - page 154 / 352 » Mapping Small Worlds |
118
click to vote
IJCAI
1993
15 years 5 months ago
1993
Many learning algorithms form concept descriptions composed of clauses, each of which covers some proportion of the positive training data and a small to zero proportion of the ne...
130
click to vote
ALGORITHMICA
2010
15 years 4 months ago
2010
The notion of fixed-parameter approximation is introduced to investigate the approximability of optimization problems within the framework of fixed-parameter computation. This work...
122
click to vote
CONNECTION
2006
15 years 4 months ago
2006
By learning a range of possible times over which the effect of an action can take place, a robot can reason more effectively about causal and contingent relationships in the world...
117
click to vote
JCSS
2006
15 years 4 months ago
2006
We introduce the probabilistic class SBP which is defined in a BPP-like manner. This class emerges from BPP by keeping the promise of a probability gap but decreasing the probabil...
144
click to vote
KI
2008
Springer
15 years 4 months ago
2008
Springer
In this paper we address the problem of how decision-theoretic policies can be repaired. This work is motivated by observations made in robotic soccer where decisiontheoretic polic...