Sciweavers

4266 search results - page 334 / 854
» The container loading problem
Sort
View
144
Voted
GECCO
2005
Springer
119views Optimization» more  GECCO 2005»
15 years 10 months ago
Learning, anticipation and time-deception in evolutionary online dynamic optimization
In this paper we focus on an important source of problem– difficulty in (online) dynamic optimization problems that has so far received significantly less attention than the tr...
Peter A. N. Bosman
ICRA
2003
IEEE
101views Robotics» more  ICRA 2003»
15 years 10 months ago
A Branch-and-Prune Algorithm for Solving Systems of Distance Constraints
— Given a set of affine varieties in ℜ3, i.e. planes, lines, and points, the problem tackled in this paper is that of finding all possible configurations for these varieties...
Josep M. Porta, Federico Thomas, Lluís Ros,...
144
Voted
CEC
2009
IEEE
15 years 9 months ago
A novel EDAs based method for HP model protein folding
— The protein structure prediction (PSP) problem is one of the most important problems in computational biology. This paper proposes a novel Estimation of Distribution Algorithms...
Benhui Chen, Long Li, Jinglu Hu
ICFCA
2009
Springer
15 years 9 months ago
A Novel Approach to Cell Formation
We present an approach to the cell formation problem, known from group technology, which is inspired by formal concept analysis. The cell formation problem consists in allocating p...
Radim Belohlávek, Niranjan Kulkarni, Vil&ea...
ISAAC
2009
Springer
87views Algorithms» more  ISAAC 2009»
15 years 9 months ago
Parameterizing Cut Sets in a Graph by the Number of Their Components
For a connected graph G = (V, E), a subset U ⊆ V is called a k-cut if U disconnects G, and the subgraph induced by U contains exactly k (≥ 1) components. More specifically, a ...
Takehiro Ito, Marcin Kaminski, Daniël Paulusm...