4894 search results - page 154 / 979 » The Guarding Problem - Complexity and Approximation |
202
click to vote
SODA
2012
ACM
13 years 8 months ago
2012
ACM
In the Stochastic Orienteering problem, we are given a metric, where each node also has a job located there with some deterministic reward and a random size. (Think of the jobs as...
139
click to vote
GECCO
2007
Springer
16 years 18 days ago
2007
Springer
The role of space is more and more accepted as a way to dramatically improve the success of coevolutionary function approximation. The process behind this success however is not y...
179
click to vote
GECCO
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. We demonstrate a fully automated method for obtaining a closedform approximation of a recursive function. This method resulted from a realworld problem in which we had a ...
146
click to vote
AAMAS
2007
Springer
15 years 6 months ago
2007
Springer
In this paper, we investigate the use of parallelization in reinforcement learning (RL), with the goal of learning optimal policies for single-agent RL problems more quickly by us...
160
click to vote
CSDA
2010
15 years 6 months ago
2010
An approximate rank revealing factorization problem with structure constraints on the normalized factors is considered. Examples of structure, motivated by an application in micro...