8016 search results - page 306 / 1604 » On the practical genetic algorithms |
164
click to vote
AAAI
2004
15 years 8 months ago
2004
Knapsack constraints are a key modeling structure in discrete optimization and form the core of many real-life problem formulations. Only recently, a cost-based filtering algorith...
157
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
We examine the use of a structured thresholding algorithm for sparse underwater channel estimation using compressed sensing. This method shows some improvements over standard algo...
140
click to vote
IPL
2002
15 years 6 months ago
2002
Constructing maximum bandwidth paths has been a basic operation in the study of network routing, in particular in the recent study of network QoS routing. In the literature, it ha...
188
click to vote
DCC
2005
IEEE
16 years 6 months ago
2005
IEEE
Minimum-entropy decoding is a universal decoding algorithm used in decoding block compression of discrete memoryless sources as well as block transmission of information across di...
182
click to vote
TIME
2009
IEEE
16 years 1 months ago
2009
IEEE
Morris, Muscettola and Vidal (MMV) presented an algorithm for checking the dynamic controllability (DC) of temporal networks in which certain temporal durations are beyond the con...