7289 search results - page 1274 / 1458 » A Dependent Set Theory |
ICALP
2003
Springer
14 years 1 months ago
2003
Springer
We study algorithmic problems that are motivated by bandwidth trading in next generation networks. Typically, bandwidth trading involves sellers (e.g., network operators) interest...
IPSN
2003
Springer
14 years 1 months ago
2003
Springer
Although data forwarding algorithms and protocols have been among the first set of issues explored in sensor networking, how to reliably deliver sensing data through a vast field...
EUROCRYPT
2010
Springer
14 years 1 months ago
2010
Springer
Imagine many small devices send data to a single receiver, encrypted using the receiver’s public key. Assume an adversary that has the power to adaptively corrupt a subset of the...
IWOMP
2010
Springer
14 years 1 months ago
2010
Springer
OpenMP is a popular and evolving programming model for shared-memory platforms. It relies on compilers to target modern hardware architectures for optimal performance. A variety of...
CCO
2001
Springer
14 years 23 days 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...