Sciweavers

1986 search results - page 345 / 398
» Path Separability of Graphs
Sort
View
DIALM
2004
ACM
165views Algorithms» more  DIALM 2004»
14 years 1 months ago
LLS: a locality aware location service for mobile ad hoc networks
Coping with mobility and dynamism is one of the biggest challenges in ad hoc networks. An essential requirement for such networks is a service that can establish communication ses...
Ittai Abraham, Danny Dolev, Dahlia Malkhi
WS
2004
ACM
14 years 1 months ago
Trust evaluation in ad-hoc networks
Title of Thesis: DISTRIBUTED TRUST EVALUATION IN AD-HOC NETWORKS Georgios E. Theodorakopoulos, Master of Science, 2004 Thesis directed by: Professor John S. Baras Department of El...
George Theodorakopoulos, John S. Baras
CSL
2004
Springer
14 years 1 months ago
Moving in a Crumbling Network: The Balanced Case
In this paper we continue the study of ‘sabotage modal logic’ SML which was suggested by van Benthem. In this logic one describes the progression along edges of a transition gr...
Philipp Rohde
ICALP
2004
Springer
14 years 1 months ago
Simple Permutations Mix Well
We study the random composition of a small family of O(n3 ) simple permutations on {0, 1}n . Specifically we ask what is the number of compositions needed to achieve a permutatio...
Shlomo Hoory, Avner Magen, Steven Myers, Charles R...
RULEML
2004
Springer
14 years 1 months ago
R-DEVICE: A Deductive RDF Rule Language
In this paper we present R-DEVICE, a deductive rule language for reasoning about RDF metadata. R-DEVICE includes features such as normal and generalized path expressions, stratifie...
Nick Bassiliades, Ioannis P. Vlahavas