Sciweavers

727 search results - page 80 / 146
» A Calculus of Bounded Capacities
Sort
View
RP
2010
Springer
146views Control Systems» more  RP 2010»
13 years 6 months ago
Depth Boundedness in Multiset Rewriting Systems with Name Binding
Abstract. In this paper we consider ν-MSR, a formalism that combines the two main existing approaches for multiset rewriting, namely MSR and CMRS. In ν-MSR we rewrite multisets o...
Fernando Rosa Velardo
STOC
2006
ACM
112views Algorithms» more  STOC 2006»
14 years 8 months ago
A quasi-PTAS for unsplittable flow on line graphs
We study the Unsplittable Flow Problem (UFP) on a line graph, focusing on the long-standing open question of whether the problem is APX-hard. We describe a deterministic quasi-pol...
Nikhil Bansal, Amit Chakrabarti, Amir Epstein, Bar...
ICC
2008
IEEE
142views Communications» more  ICC 2008»
14 years 2 months ago
Maximal Scheduling in a Hypergraph Model for Wireless Networks
— We introduce a hypergraph based interference model for scheduling in wireless networks. As a generalization of the graph model, hypergraph considers the conflicts caused by su...
Qiao Li, Gyouhwan Kim, Rohit Negi
CIAC
2006
Springer
103views Algorithms» more  CIAC 2006»
13 years 11 months ago
Provisioning a Virtual Private Network Under the Presence of Non-communicating Groups
Virtual private network design in the hose model deals with the reservation of capacities in a weighted graph such that the terminals in this network can communicate with one anoth...
Friedrich Eisenbrand, Edda Happ
ECRTS
2004
IEEE
13 years 11 months ago
An Event Stream Driven Approximation for the Analysis of Real-Time Systems
This paper presents a new approach to understand the event stream model. Additionally a new approximation algorithm for the feasibility test of the sporadic and the generalized mu...
Karsten Albers, Frank Slomka