3837 search results - page 51 / 768 » Learning Approximate Consistencies |
112
click to vote
SAGT
2009
Springer
15 years 8 months ago
2009
Springer
Computing optimal Stackelberg strategies in general two-player Bayesian games (not to be confused with Stackelberg strategies in routing games) is a topic that has recently been ga...
101
click to vote
NIPS
1994
15 years 3 months ago
1994
To appear in: G. Tesauro, D. S. Touretzky and T. K. Leen, eds., Advances in Neural Information Processing Systems 7, MIT Press, Cambridge MA, 1995. A straightforward approach to t...
FOCM
2006
15 years 1 months ago
2006
Let be an unknown Borel measure defined on the space Z := X
132
click to vote
ICML
2005
IEEE
16 years 2 months ago
2005
IEEE
A significant challenge in developing planning systems for practical applications is the difficulty of acquiring the domain knowledge needed by such systems. One method for acquir...
138
click to vote
TNN
2010
14 years 8 months ago
2010
Abstract--Recently, sparse approximation has become a preferred method for learning large scale kernel machines. This technique attempts to represent the solution with only a subse...