1182 search results - page 75 / 237 » Iterative Methods in Combinatorial Optimization |
139
click to vote
CEC
2008
IEEE
15 years 9 months ago
2008
IEEE
—Ant Colony Optimization (ACO) algorithm is a novel meta-heuristic algorithm for the approximate solution of combinatorial optimization problems that has been inspired by the for...
142
Voted
ICCAD
1999
IEEE
15 years 7 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...
IJCSA
2007
15 years 2 months ago
2007
Power system defensive islanding is an efficient way to avoid catastrophic wide area blackouts, such as the 2003 North American Blackout. Finding defensive islands of large-scale ...
139
Voted
GPEM
2002
15 years 2 months ago
2002
Ant Colony Optimization (ACO) is a metaheuristic used to solve combinatorial optimization problems. As with other metaheuristics, like evolutionary methods, ACO algorithms often sh...
125
click to vote
DAGSTUHL
2007
15 years 4 months ago
2007
Stochastic optimization problems provide a means to model uncertainty in the input data where the uncertainty is modeled by a probability distribution over the possible realizatio...