Sciweavers

706 search results - page 18 / 142
» Online Interval Scheduling
Sort
View
GLOBECOM
2008
IEEE
14 years 2 months ago
Guaranteed Boxed Localization in MANETs by Interval Analysis and Constraints Propagation Techniques
Abstract—In this contribution, we propose an original algorithm for self-localization in mobile ad-hoc networks. The proposed technique, based on interval analysis, is suited to ...
Farah Mourad, Hichem Snoussi, Fahed Abdallah, C&ea...
SCHEDULING
2010
116views more  SCHEDULING 2010»
13 years 6 months ago
Characterizing sets of jobs that admit optimal greedy-like algorithms
The “ Priority Algorithm” is a model of computation introduced by Borodin, Nielsen and Rackoff [BNR03] which formulates a wide class of greedy algorithms. For an arbitrary se...
Periklis A. Papakonstantinou, Charles Rackoff
FUZZIEEE
2007
IEEE
13 years 11 months ago
An Interval Intelligent-based Approach for Fault Detection and Modelling
Not considered in the analytical model of the plant, uncertainties always dramatically decrease the performance of the fault detection task in the practice. To cope better with thi...
Abbas Khosravi, Joaquim Armengol Llobet, Esteban R...
PDP
2010
IEEE
13 years 12 months ago
Distributed Scheduler of Workflows with Deadlines in a P2P Desktop Grid
Scheduling large amounts of tasks in distributed computing platforms composed of millions of nodes is a challenging goal, even more in a fully decentralized way and with low overhe...
Javier Celaya, Unai Arronategui
INFOCOM
2003
IEEE
14 years 27 days ago
On Guaranteed Smooth Scheduling For Input-Queued Switches
— Input-queued switches are used extensively in the design of high-speed routers. As switch speeds and sizes increase, the design of the switch scheduler becomes a primary challe...
Isaac Keslassy, Murali S. Kodialam, T. V. Lakshman...