Sciweavers

554 search results - page 49 / 111
» Approximability of OFDMA Scheduling
Sort
View
IPPS
2010
IEEE
14 years 7 months ago
Varying bandwidth resource allocation problem with bag constraints
We consider the problem of scheduling jobs on a pool of machines. Each job requires multiple machines on which it executes in parallel. For each job, the input specifies release ti...
Venkatesan T. Chakaravarthy, Vinayaka Pandit, Yogi...
CSFW
2007
IEEE
15 years 4 months ago
Compositional Security for Task-PIOAs
Task-PIOA is a modeling framework for distributed systems with both probabilistic and nondeterministic behaviors. It is suitable for cryptographic applications because its task-bas...
Ran Canetti, Ling Cheung, Dilsun Kirli Kaynar, Nan...
IJSNET
2008
125views more  IJSNET 2008»
14 years 9 months ago
Minimum-cost sensor arrangement for achieving wanted coverage lifetime
: Suppose we need to watch a set of targets continuously for a required period of time, and suppose we choose any number of sensors from a fixed set of sensor types and place them ...
Jie Wang, Ning Zhong
ENTCS
2007
98views more  ENTCS 2007»
14 years 9 months ago
Evaluating Complex MAC Protocols for Sensor Networks with APMC
In this paper we present an analysis of a MAC (Medium Access Control) protocol for wireless sensor networks. The purpose of this protocol is to manage wireless media access by con...
Michaël Cadilhac, Thomas Hérault, Rich...
IPPS
2009
IEEE
15 years 4 months ago
Resource-aware allocation strategies for divisible loads on large-scale systems
In this paper, we deal with the large-scale divisible load problem studied in [12]. We show how to reduce this problem to a classical preemptive scheduling problem on a single mac...
Anne Benoit, Loris Marchal, Jean-Francois Pineau, ...