Sciweavers

2623 search results - page 393 / 525
» tools 2010
Sort
View
SIAMCOMP
2010
133views more  SIAMCOMP 2010»
13 years 8 months ago
Faster Algorithms for All-pairs Approximate Shortest Paths in Undirected Graphs
Let G = (V, E) be a weighted undirected graph having non-negative edge weights. An estimate ˆδ(u, v) of the actual distance δ(u, v) between u, v ∈ V is said to be of stretch t...
Surender Baswana, Telikepalli Kavitha
SIAMDM
2010
133views more  SIAMDM 2010»
13 years 8 months ago
Drop Cost and Wavelength Optimal Two-Period Grooming with Ratio 4
We study grooming for two-period optical networks, a variation of the traffic grooming problem for WDM ring networks introduced by Colbourn, Quattrocchi, and Syrotiuk. In the two-...
Jean-Claude Bermond, Charles J. Colbourn, Lucia Gi...
SIGMETRICS
2010
ACM
180views Hardware» more  SIGMETRICS 2010»
13 years 8 months ago
Route oracle: where have all the packets gone?
Many network-management problems in large backbone networks need the answer to a seemingly simple question: where does a given IP packet, entering the network at a particular plac...
Yaping Zhu, Jennifer Rexford, Subhabrata Sen, Aman...
SMC
2010
IEEE
151views Control Systems» more  SMC 2010»
13 years 8 months ago
A situated approach to enterprise architecture management
Abstract—Today’s enterprises are confronted with a challenging environment that demands continuous transformations. Globalized markets, disruptive technological innovations, an...
Sabine Buckl, Christian M. Schweda, Florian Matthe...
SMR
2010
149views more  SMR 2010»
13 years 8 months ago
Capturing variability in business process models: the Provop approach
Usually, for a particular business process different variants exist. Each of them constitutes an adjustment of a reference process model to specific requirements building the proc...
Alena Hallerbach, Thomas Bauer, Manfred Reichert