Sciweavers

3105 search results - page 451 / 621
» The Path-Packing Structure of Graphs
Sort
View
PODC
2005
ACM
15 years 9 months ago
Facility location: distributed approximation
In this paper, we initiate the study of the approximability of the facility location problem in a distributed setting. In particular, we explore a trade-off between the amount of...
Thomas Moscibroda, Roger Wattenhofer
SMA
2005
ACM
109views Solid Modeling» more  SMA 2005»
15 years 9 months ago
Numerical decomposition of geometric constraints
Geometric constraint solving is a key issue in CAD/CAM. Since Owen’s seminal paper, solvers typically use graph based decomposition methods. However, these methods become diffi...
Sebti Foufou, Dominique Michelucci, Jean-Paul Jurz...
135
Voted
APN
2005
Springer
15 years 9 months ago
High-Level Nets with Nets and Rules as Tokens
Abstract. High-Level net models following the paradigm “nets as tokens” have been studied already in the literature with several interesting applications. In this paper we prop...
Kathrin Hoffmann, Hartmut Ehrig, Till Mossakowski
124
Voted
ICN
2005
Springer
15 years 9 months ago
Fault Free Shortest Path Routing on the de Bruijn Networks
It is shown that the de Bruijn graph (dBG) can be used as an architecture for interconnection networks and a suitable structure for parallel computation. Recent works have classi...
Ngoc Chi Nguyen, Vo Dinh Minh Nhat, Sungyoung Lee
WEA
2005
Springer
119views Algorithms» more  WEA 2005»
15 years 9 months ago
On Symbolic Scheduling Independent Tasks with Restricted Execution Times
Ordered Binary Decision Diagrams (OBDDs) are a data structure for Boolean functions which supports many useful operations. It finds applications in CAD, model checking, and symbol...
Daniel Sawitzki