Sciweavers

444 search results - page 41 / 89
» Termination by Abstraction
Sort
View
GG
2008
Springer
13 years 10 months ago
Formal Analysis of Model Transformations Based on Triple Graph Rules with Kernels
Abstract. Triple graph transformation has become an important approach for model transformations. Triple graphs consist of a source, a target and a connection graph. The correspond...
Hartmut Ehrig, Ulrike Prange
GLOBECOM
2008
IEEE
13 years 9 months ago
Network Planning for Next-Generation Metropolitan-Area Broadband Access under EPON-WiMAX Integration
Abstract--This paper tackles a fundamental problem of network planning and dimensioning under EPON-WiMAX integration for next-generation wireless metropolitan-area broadband access...
Bin Lin, Pin-Han Ho, Xuemin Shen, Frank Chih-Wei S...
ADHOC
2010
97views more  ADHOC 2010»
13 years 9 months ago
Modeling and analysis of two-flow interactions in wireless networks
Abstract--Interference plays a complex and often defining role in the performance of wireless networks, especially in multi-hop scenarios. In the presence of interference, Carrier ...
Saquib Razak, Vinay Kolar, Nael B. Abu-Ghazaleh
SIAMCOMP
2010
120views more  SIAMCOMP 2010»
13 years 7 months ago
Edge Disjoint Paths in Moderately Connected Graphs
Abstract. We study the Edge Disjoint Paths (EDP) problem in undirected graphs: Given a graph G with n nodes and a set T of pairs of terminals, connect as many terminal pairs as pos...
Satish Rao, Shuheng Zhou
ISAAC
2010
Springer
253views Algorithms» more  ISAAC 2010»
13 years 7 months ago
Solving Two-Stage Stochastic Steiner Tree Problems by Two-Stage Branch-and-Cut
Abstract. We consider the Steiner tree problem under a 2-stage stochastic model with recourse and finitely many scenarios (SSTP). Thereby, edges are purchased in the first stage wh...
Immanuel M. Bomze, Markus Chimani, Michael Jü...