Sciweavers

2294 search results - page 365 / 459
» From Path Graphs to Directed Path Graphs
Sort
View
ESA
2009
Springer
122views Algorithms» more  ESA 2009»
14 years 3 months ago
Bounded Budget Betweenness Centrality Game for Strategic Network Formations
In this paper, we introduce the bounded budget betweenness centrality game, a strategic network formation game in which nodes build connections subject to a budget constraint in or...
Xiaohui Bei, Wei Chen, Shang-Hua Teng, Jialin Zhan...
SIGMETRICS
2006
ACM
14 years 3 months ago
Robust network connectivity: when it's the big picture that matters
This work analyzes the connectivity of large diameter networks where every link has an independent probability p of failure. We give a (relatively simple) topological condition th...
Enoch Peserico, Larry Rudolph
ECMDAFA
2005
Springer
130views Hardware» more  ECMDAFA 2005»
14 years 2 months ago
Control Flow Analysis of UML 2.0 Sequence Diagrams
This article presents a control flow analysis methodology based on UML 2.0 sequence diagrams (SD). In contrast to the conventional code-based control flow analysis techniques, thi...
Vahid Garousi, Lionel C. Briand, Yvan Labiche
FOCS
2003
IEEE
14 years 2 months ago
Approximation Algorithms for Orienteering and Discounted-Reward TSP
In this paper, we give the rst constant-factor approximationalgorithmfor the rooted Orienteering problem, as well as a new problem that we call the Discounted-Reward TSP, motivate...
Avrim Blum, Shuchi Chawla, David R. Karger, Terran...
CCCG
2008
13 years 10 months ago
Exact Pareto-Optimal Coordination of Two Translating Polygonal Robots on a Cyclic Roadmap
We consider planning optimal collision-free motions of two polygonal robots under translation. Each robot has a reference point that must lie on a given graph, called a roadmap, w...
Hamid Reza Chitsaz, Steven M. LaValle, Jason M. O'...