Sciweavers

6518 search results - page 557 / 1304
» Distributed Individual-Based Simulation
Sort
View
CORR
2006
Springer
68views Education» more  CORR 2006»
15 years 6 months ago
A rigorous proof of the cavity method for counting matchings
In this paper we rigorously prove the validity of the cavity method for the problem of counting the number of matchings in graphs with large girth. Cavity method is an important he...
Mohsen Bayati, Chandra Nair
ISCA
2008
IEEE
101views Hardware» more  ISCA 2008»
15 years 6 months ago
Scalability in Analyzing the Availability of Large-Scale Networks using Multicast
The goal of this paper is to identify and discuss scalability issues for the measurement-based analysis of the availability in large-scale networks using IP multicast technology. ...
Falko Dressler
IJRR
2006
119views more  IJRR 2006»
15 years 6 months ago
Predicting the Performance of Cooperative Simultaneous Localization and Mapping (C-SLAM)
In this paper we study the time evolution of the position estimates' covariance in Cooperative Simultaneous Localization and Mapping (C-SLAM), and obtain analytical upper boun...
Anastasios I. Mourikis, Stergios I. Roumeliotis
EC
2007
167views ECommerce» more  EC 2007»
15 years 6 months ago
Comparison-Based Algorithms Are Robust and Randomized Algorithms Are Anytime
Randomized search heuristics (e.g., evolutionary algorithms, simulated annealing etc.) are very appealing to practitioners, they are easy to implement and usually provide good per...
Sylvain Gelly, Sylvie Ruette, Olivier Teytaud
JNW
2006
145views more  JNW 2006»
15 years 6 months ago
A Comparison of Replication Strategies for Reliable Decentralised Storage
Distributed hash tables (DHTs) can be used as the basis of a resilient lookup service in unstable environments: local routing tables are updated to reflected changes in the network...
Matthew Leslie, Jim Davies, Todd Huffman