Sciweavers

1182 search results - page 27 / 237
» Iterative Methods in Combinatorial Optimization
Sort
View
ICRA
2009
IEEE
143views Robotics» more  ICRA 2009»
15 years 8 months ago
Least absolute policy iteration for robust value function approximation
Abstract— Least-squares policy iteration is a useful reinforcement learning method in robotics due to its computational efficiency. However, it tends to be sensitive to outliers...
Masashi Sugiyama, Hirotaka Hachiya, Hisashi Kashim...
ATMOS
2007
183views Optimization» more  ATMOS 2007»
15 years 3 months ago
Solving Large Scale Crew Scheduling Problems by using Iterative Partitioning
This paper deals with large-scale crew scheduling problems arising at the Dutch railway operator, Netherlands Railways (NS). We discuss several methods to partition large instances...
Erwin J. W. Abbink, Joel Van't Wout, Dennis Huisma...
JCST
2008
134views more  JCST 2008»
15 years 1 months ago
Orthogonal Methods Based Ant Colony Search for Solving Continuous Optimization Problems
Research into ant colony algorithms for solving continuous optimization problems forms one of the most significant and promising areas in swarm computation. Although traditional an...
Xiaomin Hu, Jun Zhang, Yun Li
GECCO
2009
Springer
133views Optimization» more  GECCO 2009»
14 years 11 months ago
Improved analysis methods for crossover-based algorithms
We deepen the theoretical analysis of the genetic algorithm for the all-pairs shortest path problem proposed by Doerr, Happ and Klein (GECCO 2008). We show that the growth of the ...
Benjamin Doerr, Madeleine Theile
RECOMB
2005
Springer
16 years 2 months ago
Modeling the Combinatorial Functions of Multiple Transcription Factors
A considerable fraction of yeast gene promoters are bound by multiple transcription factors. To study the combinatorial interactions of multiple transcription factors is thus impor...
Chen-Hsiang Yeang, Tommi Jaakkola