Sciweavers

315 search results - page 40 / 63
» Experiments in Separating Computational Algorithm from Progr...
Sort
View
PERCOM
2003
ACM
14 years 7 months ago
Evaluation of Kalman Filtering for Network Time Keeping
Time information is critical for a variety of applications in distributed environments that facilitate pervasive computing and communication. This work describes and evaluates a no...
Aggelos Bletsas
ASIAN
2003
Springer
111views Algorithms» more  ASIAN 2003»
14 years 25 days ago
Unreliable Failure Detectors via Operational Semantics
Abstract. The concept of unreliable failure detectors for reliable distributed systems was introduced by Chandra and Toueg as a fine-grained means to add weak forms of synchrony i...
Uwe Nestmann, Rachele Fuzzati
TLDI
2009
ACM
155views Formal Methods» more  TLDI 2009»
14 years 4 months ago
Opis: reliable distributed systems in OCaml
The importance of distributed systems is growing as computing devices become ubiquitous and bandwidth becomes plentiful. Concurrency and distribution pose algorithmic and implemen...
Pierre-Évariste Dagand, Dejan Kostic, Vikto...
IPSN
2009
Springer
14 years 2 months ago
Predictive QoS routing to mobile sinks in wireless sensor networks
We present an algorithm for data delivery to mobile sinks in wireless sensor networks. Our algorithm is based on information potentials, which we extend to account for mobility. W...
Branislav Kusy, HyungJune Lee, Martin Wicke, Nikol...
ICGA
2008
208views Optimization» more  ICGA 2008»
13 years 7 months ago
Cross-Entropy for Monte-Carlo Tree Search
Recently, Monte-Carlo Tree Search (MCTS) has become a popular approach for intelligent play in games. Amongst others, it is successfully used in most state-of-the-art Go programs....
Guillaume Chaslot, Mark H. M. Winands, Istvan Szit...