461 search results - page 28 / 93 » Bounds for Validation |
SIROCCO
2007
14 years 10 days ago
2007
Abstract. The problem we consider originates from the design of efficient on-board networks in satellites (also called Traveling Wave Tube Amplifiers). Signals incoming in the net...
MP
2006
13 years 11 months ago
2006
Decomposition algorithms such as Lagrangian relaxation and Dantzig-Wolfe decomposition are well-known methods that can be used to generate bounds for mixed-integer linear programmi...
INFOCOM
2010
IEEE
13 years 9 months ago
2010
IEEE
— Most of the previous work on network coding has assumed that the users are not selfish and always follow the designed coding schemes. However, recent results have shown that s...
ECRTS
2007
IEEE
14 years 5 months ago
2007
IEEE
We present a multiprocessor scheduling framework for integrating hard and soft real-time tasks and best-effort jobs. This framework allows for full system utilization, and ensures...
FSTTCS
2004
Springer
14 years 4 months ago
2004
Springer
We present a fragment of separation logic oriented to linked lists, and study decision procedures for validity of entailments. The restrictions in the fragment are motivated by the...