93 search results - page 19 / 19 » Power - time optimal algorithm for computing FFT over sensor... |
WWW
2005
ACM
14 years 5 months ago
2005
ACM
While overall bandwidth in the internet has grown rapidly over the last few years, and an increasing number of clients enjoy broadband connectivity, many others still access the i...
CCO
2001
Springer
13 years 9 months ago
2001
Springer
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...
SPAA
2003
ACM
13 years 9 months ago
2003
ACM
We propose a new approach for constructing P2P networks based on a dynamic decomposition of a continuous space into cells corresponding to servers. We demonstrate the power of thi...