Sciweavers

1328 search results - page 20 / 266
» An Optimization Algorithm for the Ordered Open-End Bin-Packi...
Sort
View
IPPS
2000
IEEE
14 years 1 months ago
On Optimal Fill-Preserving Orderings of Sparse Matrices for Parallel Cholesky Factorizations
In this paper, we consider the problem of nding llpreserving ordering of a sparse symmetric and positive de nite matrix such that the reordered matrix is suitable for parallel fac...
Wen-Yang Lin, Chuen-Liang Chen
MP
2010
163views more  MP 2010»
13 years 3 months ago
Speeding up IP-based algorithms for constrained quadratic 0-1 optimization
In many practical applications, the task is to optimize a non-linear objective function over the vertices of a well-studied polytope as, e.g., the matching polytope or the travelli...
Christoph Buchheim, Frauke Liers, Marcus Oswald
CPAIOR
2011
Springer
13 years 4 days ago
Manipulating MDD Relaxations for Combinatorial Optimization
Abstract. We study the application of limited-width MDDs (multivalued decision diagrams) as discrete relaxations for combinatorial optimization problems. These relaxations are used...
David Bergman, Willem Jan van Hoeve, John N. Hooke...
ICEC
1994
68views more  ICEC 1994»
13 years 10 months ago
Extended Forking Genetic Algorithm for Order Representation (O-FGA)
There are two types of GAs with difference of their representation of strings. They are the binary coded GA and the order-based GA. We've already proposed a new type of binar...
Shigeyoshi Tsutsui, Yoshiji Fujimoto, Isao Hayashi
PPSN
2004
Springer
14 years 2 months ago
LS-CMA-ES: A Second-Order Algorithm for Covariance Matrix Adaptation
Abstract. Evolution Strategies, Evolutionary Algorithms based on Gaussian mutation and deterministic selection, are today considered the best choice as far as parameter optimizatio...
Anne Auger, Marc Schoenauer, Nicolas Vanhaecke