20 search results - page 4 / 4 » nsf 2001 |
CCO
2001
Springer
13 years 10 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...
ISCAPDCS
2001
13 years 7 months ago
2001
Reliable communication in injured hypercubes with faulty links/nodes using directed safety levels is studied in this paper. In this approach, each node u in an n-dimensional hyper...
FOCS
2009
IEEE
14 years 1 months ago
2009
IEEE
Canetti, Goldreich, Goldwasser, and Micali (STOC 2000) introduced the notion of resettable zeroknowledge proofs, where the protocol must be zero-knowledge even if a cheating veriļ...
FPGA
2001
ACM
13 years 10 months ago
2001
ACM
A prototype platform has been developed that allows processing of packets at the edge of a multi-gigabit-per-second network switch. This system, the Field Programmable Port Extend...
LCPC
2001
Springer
13 years 10 months ago
2001
Springer
This paper discusses the potential beneļ¬ts of applicationspeciļ¬c power management through remote task execution. Power management is crucial for mobile devices that have to re...