Sciweavers

8647 search results - page 550 / 1730
» The Container Selection Problem
Sort
View
ICGA
1993
96views Optimization» more  ICGA 1993»
15 years 8 months ago
Dynamic Control of Genetic Algorithms in a Noisy Environment
In this paper, we present e cient algorithms for adjusting con guration parameters of genetic algorithms that operate in a noisy environment. Assuming that the population size is ...
Akiko N. Aizawa, Benjamin W. Wah
IJSNET
2008
125views more  IJSNET 2008»
15 years 7 months ago
Minimum-cost sensor arrangement for achieving wanted coverage lifetime
: Suppose we need to watch a set of targets continuously for a required period of time, and suppose we choose any number of sensors from a fixed set of sensor types and place them ...
Jie Wang, Ning Zhong
139
Voted
CORR
2007
Springer
112views Education» more  CORR 2007»
15 years 7 months ago
Adaptive Methods for Linear Programming Decoding
—Detectability of failures of linear programming (LP) decoding and the potential for improvement by adding new constraints motivate the use of an adaptive approach in selecting t...
Mohammad H. Taghavi, Paul H. Siegel
COMCOM
2004
92views more  COMCOM 2004»
15 years 6 months ago
Genetic algorithms for multiple multicast on WDM ring network
The optimal multiple multicast problem (OMMP) on wavelength division multiplexing ring networks without wavelength conversion is considered in this paper. When the physical networ...
Der-Rong Din
DIS
2010
Springer
15 years 5 months ago
Sparse Substring Pattern Set Discovery Using Linear Programming Boosting
In this paper, we consider finding a small set of substring patterns which classifies the given documents well. We formulate the problem as 1 norm soft margin optimization problem ...
Kazuaki Kashihara, Kohei Hatano, Hideo Bannai, Mas...