4894 search results - page 292 / 979 » The Guarding Problem - Complexity and Approximation |
198
click to vote
ICML
2010
IEEE
15 years 7 months ago
2010
IEEE
Approximate dynamic programming has been used successfully in a large variety of domains, but it relies on a small set of provided approximation features to calculate solutions re...
200
click to vote
ESWS
2009
Springer
16 years 1 months ago
2009
Springer
We consider the problem of a user querying semistructured data such as RDF without knowing its structure. In these circumstances, it is helpful if the querying system can perform a...
163
click to vote
GECCO
2007
Springer
16 years 24 days ago
2007
Springer
Recently, a convergence proof of stochastic search algorithms toward finite size Pareto set approximations of continuous multi-objective optimization problems has been given. The...
159
click to vote
GECCO
2006
Springer
15 years 10 months ago
2006
Springer
The learning classifier system XCS is an iterative rulelearning system that evolves rule structures based on gradient-based prediction and rule quality estimates. Besides classifi...
159
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Existing value function approximation methods have been successfully used in many applications, but they often lack useful a priori error bounds. We propose a new approximate bili...