Sciweavers

4075 search results - page 412 / 815
» Modeling Distributed Algorithm Using B
Sort
View
AMC
2007
114views more  AMC 2007»
15 years 7 months ago
Software complexity: A statistical case study through insertion sort
: The present paper makes use of factorial experiments to assess software complexity using insertion sort as a trivial example. We next propose to implement the methodology in quic...
Anchala Kumari, Soubhik Chakraborty
IAT
2005
IEEE
16 years 14 days ago
Optimizing Agents Operation in Partially Inaccessible and Disruptive Environment
The algorithm we present in this paper aims to optimally distribute and connect the community of loosely coupled middle agents ensuring communication accessibility in a dynamic, i...
David Sislák, Martin Rehák, Michal P...
DSN
2002
IEEE
15 years 11 months ago
Evaluation of the Maximum Level Reached by a Queue Over a Finite Period
This paper deals with the performance analysis of a system modeled by a queue. If we are interested in occupation problems and if we look at the transient phase, then it makes sen...
Gerardo Rubino
NIPS
2008
15 years 8 months ago
Kernel Measures of Independence for non-iid Data
Many machine learning algorithms can be formulated in the framework of statistical independence such as the Hilbert Schmidt Independence Criterion. In this paper, we extend this c...
Xinhua Zhang, Le Song, Arthur Gretton, Alex J. Smo...
TSP
2008
100views more  TSP 2008»
15 years 6 months ago
Geographic Gossip: Efficient Averaging for Sensor Networks
Gossip algorithms for distributed computation are attractive due to their simplicity, distributed nature, and robustness in noisy and uncertain environments. However, using standa...
Alexandros G. Dimakis, Anand D. Sarwate, Martin J....