2412 search results - page 160 / 483 » Which Problems Have Strongly Exponential Complexity |
148
Voted
NIPS
2001
15 years 4 months ago
2001
We propose a new approach to reinforcement learning which combines least squares function approximation with policy iteration. Our method is model-free and completely off policy. ...
124
click to vote
GECCO
2004
Springer
15 years 9 months ago
2004
Springer
This paper presents a lens system design algorithm using the covariance matrix adaptation evolution strategy (CMA-ES), which is one of the most powerful self-adaptation mechanisms....
120
Voted
MSS
2011
IEEE
14 years 10 months ago
2011
IEEE
We consider bargaining problems under the assumption that players are loss averse, i.e., experience disutility from obtaining an outcome lower than some reference point. We follow...
115
Voted
DSD
2009
IEEE
15 years 10 months ago
2009
IEEE
Abstract—Verification of application requirements is becoming a bottleneck in system-on-chip design, as the number of applications grows. Traditionally, the verification comple...
162
Voted
PODS
1995
ACM
15 years 7 months ago
1995
ACM
Databases are often incomplete because of the presence of disjunctive information, due to con icts, partial knowledge and other reasons. Queries against such databases often ask q...