17288 search results - page 291 / 3458 » Hybrid Optimizations: Which Optimization Algorithm to Use |
153
click to vote
COCOA
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. Many combinatorial optimization problems can be formulated as 0/1 integer programs (0/1 IPs). The investigation of the structure of these problems raises the following ta...
156
click to vote
ICCAD
1999
IEEE
15 years 8 months ago
1999
IEEE
We consider the problem of finding an optimal clock schedule, i.e. optimal arrival times for clock signals at latches of a VLSI chip. We describe a general model which includes al...
128
Voted
TODAES
2008
15 years 4 months ago
2008
A new efficient algorithm is derived for the minimal period retiming by formal manipulation. Contrary to all previous algorithms, which used binary search on a range of candidate ...
135
click to vote
CORR
2004
Springer
15 years 4 months ago
2004
Springer
We study a general online convex optimization problem. We have a convex set S and an unknown sequence of cost functions c1, c2, . . . , and in each period, we choose a feasible po...
125
click to vote
HM
2010
Springer
15 years 5 months ago
2010
Springer
Dynamic Resource-Constrained Project Scheduling Problem (DRCPSP) is a scheduling problem that works with an uncommon kind of resources: the Dynamic Resources. They increase and dec...