Sciweavers

339 search results - page 28 / 68
» Is the Euclidean algorithm optimal among its peers
Sort
View
IS
2011
13 years 3 months ago
Optimized query routing trees for wireless sensor networks
In order to process continuous queries over Wireless Sensor Networks (WSNs), sensors are typically organized in a Query Routing Tree (denoted as T) that provides each sensor with ...
Panayiotis Andreou, Demetrios Zeinalipour-Yazti, A...
SAC
2009
ACM
14 years 1 months ago
Latency-aware leader election
Experimental studies have shown that electing a leader based on measurements of the underlying communication network can be beneficial. We use this approach to study the problem ...
Nuno Santos, Martin Hutle, André Schiper
CN
2002
195views more  CN 2002»
13 years 8 months ago
A simulation study of the OSPF-OMP routing algorithm
Open shortest path first (OSPF) is the most widely used internal gateway routing protocol on the Internet. However, one shortcoming is that it does not take advantage of the exist...
G. Michael Schneider, Tamás Németh
SASO
2009
IEEE
14 years 3 months ago
Self-Organization of Patrolling-Ant Algorithms
—We consider here multi-agent patrolling as the task for a group of agents to repeatedly visit all the cells of a discrete environment. Wagner et al. [1] have introduced patrolli...
Arnaud Glad, Olivier Buffet, Olivier Simonin, Fran...
CN
2007
148views more  CN 2007»
13 years 8 months ago
Using taxonomies for content-based routing with ants
Although the ant metaphor has been successfully applied to routing of data packets both in wireless and fixed networks, little is known yet about its appropriateness for search i...
Elke Michlmayr, Arno Pany, Gerti Kappel