Sciweavers

5263 search results - page 460 / 1053
» Open Constraint Optimization
Sort
View
DCC
2002
IEEE
16 years 6 months ago
Bit Allocation in Sub-linear Time and the Multiple-Choice Knapsack Problem
We show that the problem of optimal bit allocation among a set of independent discrete quantizers given a budget constraint is equivalent to the multiple choice knapsack problem (...
Alexander E. Mohr
IPPS
2009
IEEE
16 years 1 months ago
Flexible pipelining design for recursive variable expansion
Many image and signal processing kernels can be optimized for performance consuming a reasonable area by doing loops parallelization with extensive use of pipelining. This paper p...
Zubair Nawaz, Thomas Marconi, Koen Bertels, Todor ...
GECCO
2009
Springer
109views Optimization» more  GECCO 2009»
16 years 1 months ago
Crossover operators for multiobjective k-subset selection
Genetic algorithms are often applied to combinatorial optimization problems, the most popular one probably being the traveling salesperson problem. In contrast to permutations use...
Thorsten Meinl, Michael R. Berthold
GLOBECOM
2008
IEEE
16 years 1 months ago
Cross-Layer Design with Adaptive Modulation: Delay, Rate, and Energy Tradeoffs
— We present a crosslayer framework for optimizing the performance of wireless networks as measured by applications or upper layer protocols. The approach combines adaptive modul...
Daniel O'Neill, Andrea J. Goldsmith, Stephen P. Bo...
ICRA
2008
IEEE
133views Robotics» more  ICRA 2008»
16 years 1 months ago
Deployment algorithms for a power-constrained mobile sensor network
Abstract— This paper presents coverage algorithms for mobile sensor networks in which agents have limited power to move. Rather than making use of a constrained optimization tech...
Andrew Kwok, Sonia Martínez