Sciweavers

554 search results - page 37 / 111
» Approximability of OFDMA Scheduling
Sort
View
ICTCS
2003
Springer
15 years 3 months ago
Cost Constrained Fixed Job Scheduling
In this paper, we study the problem of cost constrained fixed job scheduling (CCFJS). In this problem, there are a number of processors, each of which belongs to one of several cla...
Qiwei Huang, Errol L. Lloyd
TMC
2010
196views more  TMC 2010»
14 years 8 months ago
Joint Routing, Channel Assignment, and Scheduling for Throughput Maximization in General Interference Models
—Throughput optimization in wireless networks with multiple channels and multiple radio interfaces per node is a challenging problem. For general traffic models (given a set of ...
Mahmoud Al-Ayyoub, Himanshu Gupta
APPROX
2008
Springer
107views Algorithms» more  APPROX 2008»
14 years 11 months ago
A General Framework for Designing Approximation Schemes for Combinatorial Optimization Problems with Many Objectives Combined in
Abstract. In this paper, we propose a general framework for designing fully polynomial time approximation schemes for combinatorial optimization problems, in which more than one ob...
Shashi Mittal, Andreas S. Schulz
JMLR
2010
141views more  JMLR 2010»
14 years 4 months ago
FastInf: An Efficient Approximate Inference Library
The FastInf C++ library is designed to perform memory and time efficient approximate inference in large-scale discrete undirected graphical models. The focus of the library is pro...
Ariel Jaimovich, Ofer Meshi, Ian McGraw, Gal Elida...
ICNP
2007
IEEE
15 years 4 months ago
Slotted Scheduled Tag Access in Multi-Reader RFID Systems
Abstract—Radio frequency identification (RFID) is a technology where a reader device can “sense” the presence of a closeby object by reading a tag device attached to the obj...
Zongheng Zhou, Himanshu Gupta, Samir R. Das, Xianj...