6142 search results - page 232 / 1229 » The Complexity of Partition Functions |
150
click to vote
ICMLA
2008
15 years 6 months ago
2008
In reinforcement learning, it is a common practice to map the state(-action) space to a different one using basis functions. This transformation aims to represent the input data i...
137
Voted
CORR
2006
Springer
15 years 5 months ago
2006
Springer
We consider the problem of decision-making with side information and unbounded loss functions. Inspired by probably approximately correct learning model, we use a slightly differe...
122
Voted
CADE
2006
Springer
16 years 5 months ago
2006
Springer
We introduce a dynamic logic that is enriched by non-rigid functions, i.e., functions that may change their value from state to state (during program execution), and we present a (...
139
click to vote
AAAI
2006
15 years 6 months ago
2006
While computers have defeated the best human players in many classic board games, progress in Go remains elusive. The large branching factor in the game makes traditional adversar...
137
Voted
ECCC
2000
15 years 4 months ago
2000
Abstract. We suggest a candidate one-way function using combinatorial constructs such as expander graphs. These graphs are used to determine a sequence of small overlapping subsets...