Sciweavers

3499 search results - page 236 / 700
» On the local optimality of LambdaRank
Sort
View
GECCO
2007
Springer
289views Optimization» more  GECCO 2007»
15 years 8 months ago
A discrete particle swarm optimization algorithm for the generalized traveling salesman problem
Dividing the set of nodes into clusters in the well-known traveling salesman problem results in the generalized traveling salesman problem which seeking a tour with minimum cost p...
Mehmet Fatih Tasgetiren, Ponnuthurai N. Suganthan,...
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
CCE
2004
15 years 1 months ago
Continuous reformulations of discrete-continuous optimization problems
This paper treats the solution of nonlinear optimization problems involving discrete decision variables, also known as generalized disjunctive programming (GDP) or mixed-integer n...
Oliver Stein, Jan Oldenburg, Wolfgang Marquardt
IROS
2009
IEEE
170views Robotics» more  IROS 2009»
15 years 8 months ago
Optimal trajectory design for parametric excitation walking
— Parametric excitation walking is one of methods that realize a passive dynamic like walking on the level ground. In parametric excitation walking, up-and-down motion of the cen...
Yoshihisa Banno, Yuji Harata, Kouichi Taji, Yoji U...
PLDI
2000
ACM
15 years 6 months ago
Optimal instruction scheduling using integer programming
{ This paper presents a new approach to local instruction scheduling based on integer programming that produces optimal instruction schedules in a reasonable time, even for very la...
Kent D. Wilken, Jack Liu, Mark Heffernan