Sciweavers

3049 search results - page 285 / 610
» On the Convergence of Bound Optimization Algorithms
Sort
View
CDC
2010
IEEE
139views Control Systems» more  CDC 2010»
15 years 1 months ago
Q-learning and enhanced policy iteration in discounted dynamic programming
We consider the classical finite-state discounted Markovian decision problem, and we introduce a new policy iteration-like algorithm for finding the optimal state costs or Q-facto...
Dimitri P. Bertsekas, Huizhen Yu
ICCD
1997
IEEE
100views Hardware» more  ICCD 1997»
15 years 10 months ago
Optimal Clock Period Clustering for Sequential Circuits with Retiming
Abstract— In this paper we consider the problem of clustering sequential circuits subject to a bound on the area of each cluster, with the objective of minimizing the clock perio...
Arvind K. Karandikar, Peichen Pan, C. L. Liu
IWANN
2001
Springer
15 years 11 months ago
A New Approach to Evolutionary Computation: Segregative Genetic Algorithms (SEGA)
This paper looks upon the standard genetic algorithm as an artificial self-organizing process. With the purpose to provide concepts that make the algorithm more open for scalabili...
Michael Affenzeller
GECCO
2005
Springer
163views Optimization» more  GECCO 2005»
16 years 4 days ago
An artificial immune system algorithm for CDMA multiuser detection over multi-path channels
Based on the Antibody Clonal Selection Theory of immunology, we put forward a novel clonal selection algorithm for multiuser detection in Code-division Multiple-access Systems. By...
Maoguo Gong, Ling Wang, Licheng Jiao, Haifeng Du
STOC
2002
ACM
144views Algorithms» more  STOC 2002»
16 years 7 months ago
Improved decremental algorithms for maintaining transitive closure and all-pairs shortest paths
We present improved algorithms for maintaining transitive closure and all-pairs shortest paths/distances in a digraph under deletion of edges. For the problem of transitive closur...
Surender Baswana, Ramesh Hariharan, Sandeep Sen