Sciweavers

2473 search results - page 95 / 495
» The Logic of Communication Graphs
Sort
View
ECEASST
2008
91views more  ECEASST 2008»
13 years 7 months ago
Graph Transformation Model of a Triangulated Network of Mobile Units
Abstract: A triangulated network of mobile units is modelled by means of a graph transformation system in which graph nodes are labelled with geometric coordinates and edges are la...
Stefan Gruner
TPDS
2010
109views more  TPDS 2010»
13 years 6 months ago
Minimal Sets of Turns for Breaking Cycles in Graphs Modeling Networks
Abstract—We propose an algorithm that provides for deadlockfree and livelock-free routing, in particular in wormhole routed networks. The proposed algorithm requires nearly minim...
Lev B. Levitin, Mark G. Karpovsky, Mehmet Mustafa
IPSN
2003
Springer
14 years 29 days ago
Coverage, Exploration, and Deployment by a Mobile Robot and Communication Network
We consider the problem of coverage and exploration of an unknown dynamic environment using a mobile robot(s). The environment is assumed to be large enough such that constant moti...
Maxim A. Batalin, Gaurav S. Sukhatme
ITSSA
2006
97views more  ITSSA 2006»
13 years 7 months ago
Service Evolution in Bio-Inspired Communication Systems
: An autonomic network must work unsupervised, therefore must be able to respond to unpredictable situations. The BIONETS project is working towards resilient network services that...
Daniele Miorandi, Lidia Yamamoto, Paolo Dini
CORR
2010
Springer
136views Education» more  CORR 2010»
13 years 5 months ago
Schaefer's theorem for graphs
Schaefer's theorem is a complexity classification result for so-called Boolean constraint satisfaction problems: it states that every Boolean constraint satisfaction problem ...
Manuel Bodirsky, Michael Pinsker