Sciweavers

805 search results - page 20 / 161
» Combinatorial optimization problems in self-assembly
Sort
View
EOR
2002
125views more  EOR 2002»
13 years 9 months ago
Genetic local search for multi-objective combinatorial optimization
The paper presents a new genetic local search algorithm for multi-objective combinatorial optimization. The goal of the algorithm is to generate in a short time a set of approxima...
Andrzej Jaszkiewicz
EPIA
1999
Springer
14 years 2 months ago
Combinatorial Optimization in OPL Studio
OPL is a modeling language for mathematical programming and combinatorial optimization problems. It is the first modeling language to combine high-level algebraic and set notation...
Pascal Van Hentenryck, Laurent Michel, Philippe La...
SAC
2009
ACM
14 years 4 months ago
On a discretizable subclass of instances of the molecular distance geometry problem
The molecular distance geometry problem can be formulated as the problem of finding an immersion in R3 of a given undirected, nonnegatively weighted graph G. In this paper, we di...
Carlile Lavor, Leo Liberti, Antonio Mucherino, Nel...
ICCAD
2006
IEEE
124views Hardware» more  ICCAD 2006»
14 years 6 months ago
Combinatorial algorithms for fast clock mesh optimization
We present a fast and efficient combinatorial algorithm to simultaneously identify the candidate locations as well as the sizes of the buffers driving a clock mesh. Due to the hi...
Ganesh Venkataraman, Zhuo Feng, Jiang Hu, Peng Li
GECCO
2007
Springer
262views Optimization» more  GECCO 2007»
14 years 4 months ago
Geometric particle swarm optimization for the sudoku puzzle
Geometric particle swarm optimization (GPSO) is a recently introduced generalization of traditional particle swarm optimization (PSO) that applies to all combinatorial spaces. The...
Alberto Moraglio, Julian Togelius