2168 search results - page 39 / 434 » Using Approximation Hardness to Achieve Dependable Computati... |
ACL
2010
13 years 5 months ago
2010
Nivre's method was improved by enhancing deterministic dependency parsing through application of a tree-based model. The model considers all words necessary for selection of ...
ACG
2003
Springer
14 years 29 days ago
2003
Springer
We present a new method for taking advantage of the relative independence between parts of a single-player game. We describe an implementation for improving the search in a solitai...
GECCO
2007
Springer
14 years 1 months ago
2007
Springer
The main aim of randomized search heuristics is to produce good approximations of optimal solutions within a small amount of time. In contrast to numerous experimental results, th...
SI3D
2006
ACM
14 years 1 months ago
2006
ACM
We propose a real-time method for rendering rigid objects with complex view-dependent effects under distant all-frequency lighting. Existing precomputed light transport approaches...
PKDD
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. Feature selection in reinforcement learning (RL), i.e. choosing basis functions such that useful approximations of the unkown value function can be obtained, is one of th...