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 (...
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 ...
Genetic algorithms are often applied to combinatorial optimization problems, the most popular one probably being the traveling salesperson problem. In contrast to permutations use...
— 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...
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...