Sciweavers

14739 search results - page 340 / 2948
» An optimization problem on the sphere
Sort
View
77
Voted
GECCO
2007
Springer
161views Optimization» more  GECCO 2007»
15 years 5 months ago
On solving hierarchical problems with top down control
We review recent work on the Hierarchical-If-And-Only-If problem and present a new hierarchical problem, HIFF-M that does not fit with previous explanations for evolutionary diffi...
Susan Khor
HICSS
2003
IEEE
200views Biometrics» more  HICSS 2003»
15 years 5 months ago
A Dynamic Assignment Problem in a Mobile System with Limited Bandwidth
The assignment problem originally arising from parallel and distributed computing has been investigated intensively since the 70’s when Harold Stone proposed a method to solve i...
Yang Wang 0006, Thomas Kunz
CIAC
2000
Springer
105views Algorithms» more  CIAC 2000»
15 years 4 months ago
Algorithms for a Simple Point Placement Problem
We consideralgorithms for a simple one-dimensionalpoint placement problem: given N points on a line, and noisy measurements of the distances between many pairs of them, estimate th...
Joshua Redstone, Walter L. Ruzzo
PPSN
1998
Springer
15 years 3 months ago
Genetic Algorithms for the Multiple Container Packing Problem
This paper presents two variants of Genetic Algorithms (GAs) for solving the Multiple Container Packing Problem (MCPP), which is a combinatorial optimization problem comprising sim...
Günther R. Raidl, Gabriele Kodydek
ATAL
2006
Springer
15 years 3 months ago
Distributed Lagrangean relaxation protocol for the generalized mutual assignment problem
Abstract. The generalized assignment problem (GAP) is a typical NP-hard problem and has been studied for many years mainly in the operations research community. The goal of the GAP...
Katsutoshi Hirayama