Sciweavers

2714 search results - page 72 / 543
» Approximation Schemes for Scheduling
Sort
View
103
Voted
TSP
2010
14 years 7 months ago
Quasi-interpolation by means of filter-banks
We consider the problem of approximating a regular function f(t) from its samples, f(nT), taken in a uniform grid. Quasi-interpolation schemes approximate f(t) with a dilated versi...
Gerardo Pérez-Villalón
94
Voted
INFOCOM
2003
IEEE
15 years 5 months ago
Dynamic Load Balancing Through Coordinated Scheduling in Packet Data Systems
— Third generation code-division multiple access (CDMA) systems propose to provide packet data service through a high speed shared channel with intelligent and fast scheduling at...
Suman Das, Harish Viswanathan, Gee Rittenhouse
110
Voted
WINET
2010
159views more  WINET 2010»
14 years 11 months ago
Approximation algorithm for minimal convergecast time problem in wireless sensor networks
In this paper we consider how to collect data from sensors deployed in the Euclidean plane in a timeefficient way. We assume that all sensors could adjust their transmission range...
Weiping Shang, Peng-Jun Wan, Xiaodong Hu
102
Voted
LICS
2003
IEEE
15 years 5 months ago
Labelled Markov Processes: Stronger and Faster Approximations
This paper reports on and discusses three notions of approximation for Labelled Markov Processes that have been developed last year. The three schemes are improvements over former...
Vincent Danos, Josee Desharnais
114
Voted
ICC
2007
IEEE
139views Communications» more  ICC 2007»
15 years 6 months ago
Generic Centralized Downlink Scheduler for Next Generation Wireless Cellular Networks
– Future wireless cellular networks such as High Speed Downlink Packet Access (HSDPA) and 1x EVolution Data Optimized (1xEV-DO) promise to revolutionize the mobile user’s wirel...
Bader Al-Manthari, Najah A. Abu Ali, Nidal Nasser,...