1182 search results - page 73 / 237 » Iterative Methods in Combinatorial Optimization |
106
click to vote
ISSAC
2007
Springer
15 years 8 months ago
2007
Springer
Approximate symbolic computation problems can be formulated as constrained or unconstrained optimization problems, for example: GCD [3, 8, 12, 13, 23], factorization [5, 10], and ...
132
Voted
TASE
2010
IEEE
14 years 9 months ago
2010
IEEE
Group elevator scheduling has received considerable attention due to its importance to transportation efficiency for mid-rise and high-rise buildings. One important trend to improv...
126
Voted
SWARM
2010
SPRINGER
15 years 7 months ago
2010
SPRINGER
Abstract. In this work we propose a different particle swarm optimization (PSO) algorithm that employs two key features of the conjugate gradient (CG) method. Namely, adaptive wei...
141
Voted
ISCAS
2011
IEEE
14 years 6 months ago
2011
IEEE
—A unified optimization framework is presented for simultaneous gate sizing and placement. These processes are unified using Lagrangian multipliers, which synchronize the efforts...
124
Voted
CEC
2008
IEEE
15 years 9 months ago
2008
IEEE
—In this paper, the multiple trajectory search (MTS) is presented for large scale global optimization. The MTS uses multiple agents to search the solution space concurrently. Eac...