269 search results - page 29 / 54 » A branch and bound method for stochastic global optimization |
AE
2005
Springer
15 years 3 months ago
2005
Springer
Randomization is an efficient tool for global optimization. We here define a method which keeps : – the order 0 of evolutionary algorithms (no gradient) ; – the stochastic as...
87
Voted
IPPS
2002
IEEE
15 years 2 months ago
2002
IEEE
The BMI Eigenvalue Problem is one of optimization problems and is to minimize the greatest eigenvalue of a bilinear matrix function. This paper proposes a parallel algorithm to co...
GLVLSI
1996
IEEE
15 years 1 months ago
1996
IEEE
In this paper, we propose a global routing algorithm for multi-layer building-block layouts. The algorithm is based on successive ripup and rerouting while satisfying edge capacit...
NETWORKS
2008
14 years 9 months ago
2008
The resource-constrained elementary shortest path problem arises as a pricing subproblem in branch-and-price algorithms for vehicle routing problems with additional constraints. W...
103
click to vote
IOPADS
1997
14 years 11 months ago
1997
We provide a competitive analysis framework for online prefetching and buffer management algorithms in parallel I/O systems, using a read-once model of block references. This has ...