Sciweavers

4266 search results - page 109 / 854
» The container loading problem
Sort
View
CEC
2010
IEEE
14 years 12 months ago
A hybrid multi-objective extremal optimisation approach for multi-objective combinatorial optimisation problems
Extremal optimisation (EO) is a relatively recent nature-inspired heuristic whose search method is especially suitable to solve combinatorial optimisation problems. To date, most o...
Pedro Gómez-Meneses, Marcus Randall, Andrew...
FGR
2002
IEEE
161views Biometrics» more  FGR 2002»
15 years 7 months ago
Baseline Results for the Challenge Problem of Human ID Using Gait Analysis
Identification of people from gait captured on video has become a challenge problem in computer vision. However, there is not a baseline algorithm or standard dataset for measuri...
P. Jonathon Phillips, Patrick Grother, Sudeep Sark...
JSAC
2007
63views more  JSAC 2007»
15 years 2 months ago
A new survivable mapping problem in IP-over-WDM networks
— We introduce a new version of the widely studied survivable mapping problem in IP-over-WDM networks. The new problem allows augmenting the given logical topology and is describ...
Chang Liu, Lu Ruan
TCS
2002
15 years 2 months ago
The chords' problem
The chords' problem is a variant of an old problem of computational geometry: given a set of points of n , one can easily build the multiset of the distances between the poi...
Alain Daurat, Yan Gérard, Maurice Nivat
IWOCA
2009
Springer
104views Algorithms» more  IWOCA 2009»
15 years 9 months ago
An O(n)-Time Algorithm for the Paired-Domination Problem on Permutation Graphs
A vertex subset D of a graph G is a dominating set if every vertex of G is either in D or is adjacent to a vertex in D. The paired-domination problem on G asks for a minimum-cardi...
Evaggelos Lappas, Stavros D. Nikolopoulos, Leonida...