Sciweavers

2814 search results - page 23 / 563
» Competitive Analysis of Distributed Algorithms
Sort
View
FTDCS
1997
IEEE
15 years 8 months ago
A Scheduling Algorithm for Aperiodic Groups of Tasks in Distributed Real-Time Systems and its Holistic Analysis
This paper deals with the problem of scheduling aperiodic groups of tasks in distributed systems. It proposes two contributions, namely: i) a distributed scheduling algorithm to b...
Paolo Bizzarri, Andrea Bondavalli, Felicita Di Gia...
COOPIS
2004
IEEE
15 years 8 months ago
Classification and Analysis of Distributed Event Filtering Algorithms
Publish/subscribe middleware provides efficient support for loosely coupled communication in distributed systems. A number of different distributed message-filtering algorithms hav...
Sven Bittner, Annika Hinze
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
CEC
2007
IEEE
15 years 10 months ago
On the analysis of average time complexity of estimation of distribution algorithms
— Estimation of Distribution Algorithm (EDA) is a well-known stochastic optimization technique. The average time complexity is a crucial criterion that measures the performance o...
Tianshi Chen, Ke Tang, Guoliang Chen, Xin Yao
CEC
2009
IEEE
15 years 11 months ago
Rigorous time complexity analysis of Univariate Marginal Distribution Algorithm with margins
—Univariate Marginal Distribution Algorithms (UMDAs) are a kind of Estimation of Distribution Algorithms (EDAs) which do not consider the dependencies among the variables. In thi...
Tianshi Chen, Ke Tang, Guoliang Chen, Xin Yao