Sciweavers

1370 search results - page 78 / 274
» On grids in topological graphs
Sort
View
GD
2008
Springer
15 years 29 days ago
Generalizing the Shift Method for Rectangular Shaped Vertices with Visibility Constraints
In this paper we present a generalization of the shift method algorithm [4, 6] to obtain a straight-line grid drawing of a triconnected graph, where vertex representations have a c...
Seok-Hee Hong, Martin Mader
ICCS
2009
Springer
15 years 6 months ago
Improving the Scalability of SimGrid Using Dynamic Routing
Research into large-scale distributed systems often relies on the use of simulation frameworks in order to bypass the disadvantages of performing experiments on real testbeds. SimG...
Silas De Munck, Kurt Vanmechelen, Jan Broeckhove
IPPS
2003
IEEE
15 years 5 months ago
Simulation of Dynamic Data Replication Strategies in Data Grids
Data Grids provide geographically distributed resources for large-scale data-intensive applications that generate large data sets. However, ensuring efficient access to such huge...
Houda Lamehamedi, Zujun Shentu, Boleslaw K. Szyman...
ISIM
2007
15 years 1 months ago
Formal Computation Independent Model of the Problem Domain within the MDA
The proposed approach called Topological Functioning Modeling for Model Driven Architecture (TFMfMDA) uses formal mathematical foundations of Topological Functioning Model. It intr...
Janis Osis, Erika Asnina, Andrejs Grave
CN
2006
70views more  CN 2006»
14 years 12 months ago
Small-world characteristics of Internet topologies and implications on multicast scaling
Recent work has shown that the physical connectivity of the Internet exhibits small-world behavior. Characterizing such behavior is important not only for generating realistic Int...
Shudong Jin, Azer Bestavros