Sciweavers

54 search results - page 11 / 11
» Network Coding for Computing: Cut-Set Bounds
Sort
View
DSN
2009
IEEE
13 years 8 months ago
Efficient resource management on template-based web servers
The most commonly used request processing model in multithreaded web servers is thread-per-request, in which an individual thread is bound to serve each web request. However, with...
Eli Courtwright, Chuan Yue, Haining Wang
QSHINE
2005
IEEE
13 years 10 months ago
Retransmission Strategies for Wireless Connections with Resource-Limited Devices
Protocols designed to provide error-free communications over lossy links, at both data link and transport layers, commonly employ the idea of sliding windows, which is based on th...
Lavy Libman
HPCA
2002
IEEE
14 years 5 months ago
CableS: Thread Control and Memory Management Extensions for Shared Virtual Memory Clusters
Clusters of high-end workstations and PCs are currently used in many application domains to perform large-scale computations or as scalable servers for I/O bound tasks. Although c...
Peter Jamieson, Angelos Bilas
CCO
2001
Springer
161views Combinatorics» more  CCO 2001»
13 years 9 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...