23 search results - page 2 / 5 » Iterative robust control: Speeding up improvement through it... |
IPPS
2010
IEEE
13 years 7 months ago
2010
IEEE
Local search (LS) algorithms are among the most powerful techniques for solving computationally hard problems in combinatorial optimization. These algorithms could be viewed as &q...
PPL
2010
13 years 4 months ago
2010
Local search (LS) algorithms are among the most powerful techniques for solving computationally hard problems in combinatorial optimization. These algorithms could be viewed as &q...
TSP
2010
13 years 4 months ago
2010
The problem of distributed average consensus with quantized data is considered in this correspondence. Conventional consensus algorithms suffer from divergence when quantization er...
CGO
2003
IEEE
14 years 3 months ago
2003
IEEE
To meet the performance demands of modern architectures, compilers incorporate an everincreasing number of aggressive code transformations. Since most of these transformations are...
DATE
2007
IEEE
14 years 4 months ago
2007
IEEE
We present a decomposition strategy to speed up constraint optimization for a representative multiprocessor scheduling problem. In the manner of Benders decomposition, our techniq...