Sciweavers

4894 search results - page 516 / 979
» The Guarding Problem - Complexity and Approximation
Sort
View
INFOCOM
2009
IEEE
15 years 11 months ago
Time Slicing in Mobile TV Broadcast Networks with Arbitrary Channel Bit Rates
Abstract—Mobile TV networks have received significant attention from the industry and academia, as they have already been deployed in several countries and their expected market...
Cheng-Hsin Hsu, Mohamed Hefeeda
IPPS
2009
IEEE
15 years 11 months ago
Minimizing total busy time in parallel scheduling with application to optical networks
—We consider a scheduling problem in which a bounded number of jobs can be processed simultaneously by a single machine. The input is a set of n jobs J = {J1, . . . , Jn}. Each j...
Michele Flammini, Gianpiero Monaco, Luca Moscardel...
APPROX
2009
Springer
153views Algorithms» more  APPROX 2009»
15 years 11 months ago
Average-Case Analyses of Vickrey Costs
We explore the average-case “Vickrey” cost of structures in a random setting: the Vickrey cost of a shortest path in a complete graph or digraph with random edge weights; the V...
Prasad Chebolu, Alan M. Frieze, Páll Melste...
ICASSP
2008
IEEE
15 years 11 months ago
A new Particle Filtering algorithm with structurally optimal importance function
Bayesian estimation in nonlinear stochastic dynamical systems has been addressed for a long time. Among other solutions, Particle Filtering (PF) algorithms propagate in time a Mon...
Boujemaa Ait-El-Fquih, François Desbouvries
ICC
2007
IEEE
168views Communications» more  ICC 2007»
15 years 11 months ago
Energy and QoS Aware Packet Forwarding in Wireless Sensor Networks
— We consider energy efficient packet forwarding with quality-of-service (QoS) guarantee for wireless sensor networks (WSNs). In most existing wireless network protocols, route ...
Rong Yu, Yan Zhang, Zhi Sun, Shunliang Mei