Sciweavers

8647 search results - page 196 / 1730
» The Container Selection Problem
Sort
View
AE
1999
Springer
15 years 7 months ago
Characterizing Locality in Decoder-Based EAs for the Multidimensional Knapsack Problem
The performance of decoder-based evolutionary algorithms (EAs) strongly depends on the locality of the used decoder and operators. While many approaches to characterize locality ar...
Jens Gottlieb, Günther R. Raidl
FAW
2008
Springer
104views Algorithms» more  FAW 2008»
15 years 5 months ago
The Parameterized Complexity of the Rectangle Stabbing Problem and Its Variants
We study the parameterized complexity of an NP-complete geometric covering problem called d-dimensional Rectangle Stabbing where we are given a set of axis-parallel d-dimensional h...
Michael Dom, Somnath Sikdar
137
Voted
CCCG
2008
15 years 4 months ago
On distinct distances among points in general position and other related problems
A set of points in the plane is said to be in general position if no three of them are collinear and no four of them are cocircular. If a point set determines only distinct vector...
Adrian Dumitrescu
128
Voted
IJCAI
2003
15 years 4 months ago
When Evolving Populations is Better than Coevolving Individuals: The Blind Mice Problem
This paper is about the evolutionary design of multi-agent systems. An important part of recent research in this domain has been focusing on collaborative revolutionary methods. W...
Thomas Miconi
129
Voted
CCE
2007
15 years 3 months ago
Generate Pareto optimal solutions of scheduling problems using normal boundary intersection technique
The problem of short-term scheduling under uncertainty is addressed in this paper through a multiobjective optimization framework that incorporates economic expectation, robustnes...
Zhenya Jia, Marianthi G. Ierapetritou