Sciweavers

805 search results - page 111 / 161
» Combinatorial optimization problems in self-assembly
Sort
View
GECCO
2006
Springer
164views Optimization» more  GECCO 2006»
15 years 1 months ago
Adaptation for parallel memetic algorithm based on population entropy
In this paper, we propose the island model parallel memetic algorithm with diversity-based dynamic adaptive strategy (PMADLS) for controlling the local search frequency and demons...
Jing Tang, Meng-Hiot Lim, Yew-Soon Ong
EOR
2006
148views more  EOR 2006»
14 years 10 months ago
Pareto ant colony optimization with ILP preprocessing in multiobjective project portfolio selection
One of the most important, common and critical management issues lies in determining the "best" project portfolio out of a given set of investment proposals. As this dec...
Karl F. Doerner, Walter J. Gutjahr, Richard F. Har...
LPAR
2005
Springer
15 years 3 months ago
Another Complete Local Search Method for SAT
Local search algorithms are one of the effective methods for solving hard combinatorial problems. However, a serious problem of this approach is that the search often traps at loca...
Haiou Shen, Hantao Zhang
UAI
2004
14 years 11 months ago
Bidding under Uncertainty: Theory and Experiments
This paper describes a study of agent bidding strategies, assuming combinatorial valuations for complementary and substitutable goods, in three auction environments: sequential au...
Amy R. Greenwald, Justin A. Boyan
ICML
2006
IEEE
15 years 10 months ago
Generalized spectral bounds for sparse LDA
We present a discrete spectral framework for the sparse or cardinality-constrained solution of a generalized Rayleigh quotient. This NPhard combinatorial optimization problem is c...
Baback Moghaddam, Yair Weiss, Shai Avidan