2957 search results - page 20 / 592 » The Complexity of Polynomial-Time Approximation |
127
Voted
ICML
2009
IEEE
16 years 4 months ago
2009
IEEE
We consider the exploration/exploitation problem in reinforcement learning (RL). The Bayesian approach to model-based RL offers an elegant solution to this problem, by considering...
129
click to vote
ICDT
2007
ACM
15 years 10 months ago
2007
ACM
Stay macro tree transducers (smtts) are an expressive formalism for reasoning about XSLT-like document transformations. Here, we consider the exact type checking problem for smtts....
142
click to vote
FOCS
2008
IEEE
15 years 4 months ago
2008
IEEE
We consider markets in the classical Arrow-Debreu model. There are n agents and m goods. Each buyer has a concave utility function (of the bundle of goods he/she buys) and an init...
141
click to vote
JMLR
2006
15 years 3 months ago
2006
Fast and frugal heuristics are well studied models of bounded rationality. Psychological research has proposed the take-the-best heuristic as a successful strategy in decision mak...
176
click to vote
STOC
2010
ACM
15 years 8 months ago
2010
ACM
Consider the following two-player communication process to decide a language L: The first player holds the entire input x but is polynomially bounded; the second player is computa...