Sciweavers

12015 search results - page 513 / 2403
» Interactive Algorithms 2005
Sort
View
RTCSA
2005
IEEE
15 years 10 months ago
Approximation Algorithms for Scheduling Multiple Feasible Interval Jobs
Abstract— Time-critical jobs in many real-time applications have multiple feasible intervals. Such a job is constrained to execute from start to completion in one of its feasible...
Jian-Jia Chen, Jun Wu, Chi-Sheng Shih, Tei-Wei Kuo
RTSS
2005
IEEE
15 years 10 months ago
A Deferrable Scheduling Algorithm for Real-Time Transactions Maintaining Data Freshness
Periodic update transaction model has been used to maintain freshness (or temporal validity) of real-time data. Period and deadline assignment has been the main focus in the past ...
Ming Xiong, Song Han, Kam-yiu Lam
IPSN
2005
Springer
15 years 10 months ago
Robust computation of aggregates in wireless sensor networks: distributed randomized algorithms and analysis
A wireless sensor network consists of a large number of small, resource-constrained devices and usually operates in hostile environments that are prone to link and node failures. ...
Jen-Yeu Chen, Gopal Pandurangan, Dongyan Xu
PVM
2005
Springer
15 years 10 months ago
Scalable Fault Tolerant MPI: Extending the Recovery Algorithm
ct Fault Tolerant MPI (FT-MPI)[6] was designed as a solution to allow applications different methods to handle process failures beyond simple check-point restart schemes. The init...
Graham E. Fagg, Thara Angskun, George Bosilca, Jel...
156
Voted
WABI
2005
Springer
143views Bioinformatics» more  WABI 2005»
15 years 10 months ago
A Faster Algorithm for Detecting Network Motifs
Motifs in a network are small connected subnetworks that occur in significantly higher frequencies than in random networks. They have recently gathered much attention as a useful ...
Sebastian Wernicke