Sciweavers

419 search results - page 71 / 84
» First Order Paths in Ordered Trees
Sort
View
CN
2006
85views more  CN 2006»
13 years 10 months ago
A scalable and decentralized fast-rerouting scheme with efficient bandwidth sharing
This paper focuses on the protection of virtual circuits (Label Switched Paths, LSPs) in a (G)MPLS (Generalised Multi-Protocol Label Switching) network. The proposed algorithm is ...
Simon Balon, Laurent Mélon, Guy Leduc
CORR
2006
Springer
108views Education» more  CORR 2006»
13 years 10 months ago
Two polygraphic presentations of Petri nets
: This document gives an algebraic and two polygraphic translations of Petri nets, all three providing an easier way to describe reductions and to identify some of them. The first ...
Yves Guiraud
ADHOC
2005
95views more  ADHOC 2005»
13 years 10 months ago
Planar graph routing on geographical clusters
Geographic routing protocols base their forwarding decisions on the location of the current device, its neighbors, and the packets destination. Early proposed heuristic greedy rou...
Hannes Frey, Daniel Görgen
ICDE
2009
IEEE
223views Database» more  ICDE 2009»
14 years 11 months ago
Another Outlier Bites the Dust: Computing Meaningful Aggregates in Sensor Networks
Abstract-- Recent work has demonstrated that readings provided by commodity sensor nodes are often of poor quality. In order to provide a valuable sensory infrastructure for monito...
Antonios Deligiannakis, Yannis Kotidis, Vasilis Va...
GECCO
2004
Springer
14 years 3 months ago
Multi-agent Cooperation Using Genetic Network Programming with Automatically Defined Groups
In this paper, we propose a genetic network programming (GNP) architecture using a coevolution model called automatically defined groups (ADG). The GNP evolves networks for describ...
Tadahiko Murata, Takashi Nakamura