Sciweavers

4208 search results - page 157 / 842
» Challenges in Evaluating Distributed Algorithms
Sort
View
JAIR
2008
110views more  JAIR 2008»
15 years 1 months ago
Completeness and Performance Of The APO Algorithm
Asynchronous Partial Overlay (APO) is a search algorithm that uses cooperative mediation to solve Distributed Constraint Satisfaction Problems (DisCSPs). The algorithm partitions ...
Tal Grinshpoun, Amnon Meisels
INFOCOM
1999
IEEE
15 years 6 months ago
Performance Analysis on Path Rerouting Algorithms for Handoff Control in Mobile ATM Networks
This paper studies mobile-generated traffic distributions in mobile ATM networks and evaluates the performance of path rerouting algorithms for handoff control. In mobile ATM netwo...
Jun Li, Roy D. Yates, Dipankar Raychaudhuri
IPPS
2006
IEEE
15 years 7 months ago
Wrekavoc: a tool for emulating heterogeneity
Computer science and especially heterogeneous distributed computing is an experimental science. Simulation, emulation, or in-situ implementation are complementary methodologies to...
Louis-Claude Canon, Emmanuel Jeannot
MIDDLEWARE
2004
Springer
15 years 7 months ago
Adapting asynchronous messaging middleware to ad hoc networking
The characteristics of mobile environments, with the possibility of frequent disconnections and fluctuating bandwidth, have forced a rethink of traditional middleware. In particu...
Mirco Musolesi, Cecilia Mascolo, Stephen Hailes
FSMNLP
2005
Springer
15 years 7 months ago
Algorithms for Minimum Risk Chunking
Abstract. Stochastic finite automata are useful for identifying substrings (chunks) within larger units of text. Relevant applications include tokenization, base-NP chunking, name...
Martin Jansche