817 search results - page 23 / 164 » An Optimal Linear Time Algorithm for Quasi-Monotonic Segment... |
JMLR
2010
13 years 3 months ago
2010
Actor-Critic based approaches were among the first to address reinforcement learning in a general setting. Recently, these algorithms have gained renewed interest due to their gen...
GECCO
2000
Springer
14 years 7 days ago
2000
Springer
This paper gives a theoretical and empirical analysis of the time complexity of genetic algorithms (GAs) on problems with exponentially scaled building blocks. It is important to ...
MICCAI
2000
Springer
14 years 6 days ago
2000
Springer
Abstract. We present a fast and accurate tool for semiautomatic segmentation of volumetric medical images based on the live wire algorithm, shape-based interpolation and a new opti...
EUROGP
2008
Springer
13 years 10 months ago
2008
Springer
We present N-gram GP, an estimation of distribution algorithm for the evolution of linear computer programs. The algorithm learns and samples the joint probability distribution of...
DAC
1997
ACM
14 years 25 days ago
1997
ACM
Buffer insertion seeks to place buffers on the wires of a signal net to minimize delay. Van Ginneken [14] proposed an optimal dynamic programming solution (with extensions propose...