Sciweavers

4075 search results - page 217 / 815
» Modeling Distributed Algorithm Using B
Sort
View
PDCAT
2005
Springer
16 years 2 days ago
A New Algorithm to Solve Synchronous Consensus for Dependent Failures
Fault tolerant algorithms are often designed under the t-out-of-n assumption, which is based on the assumption that all processes or components fail independently with equal proba...
Jun Wang, Min Song
WADS
2009
Springer
226views Algorithms» more  WADS 2009»
16 years 1 months ago
Online Priority Steiner Tree Problems
Abstract. A central issue in the design of modern communication networks is the provision of Quality-of-Service (QoS) guarantees at the presence of heterogeneous users. For instanc...
Spyros Angelopoulos
MICCAI
2007
Springer
16 years 7 months ago
A Probabilistic Model for Haustral Curvatures with Applications to Colon CAD
Among the many features used for classification in computer-aided detection (CAD) systems targeting colonic polyps, those based on differences between the shapes of polyps and fold...
John Melonakos, Paulo R. S. Mendonça, Rahul...
ICDM
2008
IEEE
230views Data Mining» more  ICDM 2008»
16 years 1 months ago
Clustering Distributed Time Series in Sensor Networks
Event detection is a critical task in sensor networks, especially for environmental monitoring applications. Traditional solutions to event detection are based on analyzing one-sh...
Jie Yin, Mohamed Medhat Gaber
IROS
2006
IEEE
144views Robotics» more  IROS 2006»
16 years 18 days ago
Estimating Probability Distribution with Q-learning for Biped Gait Generation and Optimization
— A new biped gait generation and optimization method is proposed in the frame of Estimation of Distribution Algorithms (EDAs) with Q-learning method. By formulating the biped ga...
Lingyun Hu, Changjiu Zhou, Zengqi Sun