23 search results - page 2 / 5 » Upper bounds for revenue maximization in a satellite schedul... |
COR
2008
13 years 5 months ago
2008
The Swath Segment Selection Problem (SSSP) is an NP-hard combinatorial optimization problem arising in the context of planning and scheduling satellite operations. It was defined ...
INFOCOM
2008
IEEE
13 years 11 months ago
2008
IEEE
— We present an approach that takes advantage of multi-packet reception (MPR) to reduce the negative effects of multiple access interference and therefore increase the capacity o...
CN
2007
13 years 5 months ago
2007
Efficient dynamic resource provisioning algorithms are necessary to the development and automation of Quality of Service (QoS) networks. The main goal of these algorithms is to o...
COR
2011
12 years 11 months ago
2011
We consider the problem of scheduling a maximum profit selection of equal length jobs on m identical machines. Jobs arrive online over time and the goal is to determine a non-pre...
INFOCOM
2007
IEEE
13 years 11 months ago
2007
IEEE
— We consider the problem of throughput-optimal cross-layer design of wireless networks. We propose a joint congestion control and scheduling algorithm that achieves a fraction d...