4843 search results - page 147 / 969 » The Shortcut Problem - Complexity and Approximation |
GECCO
2007
Springer
15 years 9 months 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...
131
click to vote
GECCO
2004
Springer
15 years 8 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 ...
109
click to vote
AAMAS
2007
Springer
15 years 3 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...
116
click to vote
CSDA
2010
15 years 3 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...
150
click to vote
WADS
2007
Springer
15 years 9 months ago
2007
Springer
We present a polynomial-time approximation scheme (PTAS) for the Steiner tree problem with polygonal obstacles in the plane with running time O(n log2 n), where n denotes the numb...