Sciweavers

4072 search results - page 465 / 815
» Designing an Optimal Network Using the Cross-Entropy Method
Sort
View
DSD
2008
IEEE
166views Hardware» more  DSD 2008»
15 years 10 months ago
Pearson - based Analysis of Positioning Error Distribution in Wireless Sensor Networks
Abstract—In two recent contributions [1], [2], we have provided a comparative analysis of various optimization algorithms, which can be used for atomic location estimation, and s...
Stefano Tennina, Marco Di Renzo, Fabio Graziosi, F...
CCO
2001
Springer
161views Combinatorics» more  CCO 2001»
15 years 8 months ago
Branch, Cut, and Price: Sequential and Parallel
Branch, cut, and price (BCP) is an LP-based branch and bound technique for solving large-scale discrete optimization problems (DOPs). In BCP, both cuts and variables can be generat...
Laszlo Ladányi, Ted K. Ralphs, Leslie E. Tr...
EOR
2006
135views more  EOR 2006»
15 years 4 months ago
Principles of scatter search
Scatter search is an evolutionary method that has been successfully applied to hard optimization problems. The fundamental concepts and principles of the method were first propose...
Rafael Martí, Manuel Laguna, Fred Glover
ICC
2009
IEEE
135views Communications» more  ICC 2009»
15 years 2 months ago
Adaptive Compress-and-Forward Relaying in Fading Environments with or without Wyner-Ziv Coding
Abstract--Compress-and-Forward is a protocol for transmission over relay networks in which the relay forwards a compressed version of the signal it observes. The compression method...
Harold H. Sneessens, Luc Vandendorpe, J. Nicholas ...
DAC
2003
ACM
16 years 5 months ago
Dynamic hardware/software partitioning: a first approach
Partitioning an application among software running on a microprocessor and hardware co-processors in on-chip configurable logic has been shown to improve performance and energy co...
Greg Stitt, Roman L. Lysecky, Frank Vahid