Sciweavers

3678 search results - page 634 / 736
» On the Stable Paths Problem
Sort
View
110
Voted
WADS
2005
Springer
111views Algorithms» more  WADS 2005»
15 years 6 months ago
On Geometric Dilation and Halving Chords
Let G be an embedded planar graph whose edges may be curves. The detour between two points, p and q (on edges or vertices) of G, is the ratio between the shortest path in G between...
Adrian Dumitrescu, Annette Ebbers-Baumann, Ansgar ...
89
Voted
WS
2004
ACM
15 years 6 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
73
Voted
CAISE
2004
Springer
15 years 6 months ago
Towards Computer-aided Design of OCL Constraints
In UML2.0, significant efforts have been devoted towards a better definition of OCL. Still, the adoption of the language by the software engineers remains a significant challenge....
Yves Ledru, Sophie Dupuy-Chessa, Hind Fadil
CSL
2004
Springer
15 years 6 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
100
Voted
GD
2004
Springer
15 years 6 months ago
Drawing Power Law Graphs
It has been noted that many realistic graphs have a power law degree distribution and exhibit the small world phenomenon. We present drawing methods influenced by recent developm...
Reid Andersen, Fan R. K. Chung, Lincoln Lu