Sciweavers

1059 search results - page 202 / 212
» Improved Algorithms via Approximations of Probability Distri...
Sort
View
SPAA
2003
ACM
14 years 25 days ago
Short length menger's theorem and reliable optical routing
In the minimum path coloring problem, we are given a graph and a set of pairs of vertices of the graph and we are asked to connect the pairs by colored paths in such a way that pa...
Amitabha Bagchi, Amitabh Chaudhary, Petr Kolman
CORR
2002
Springer
122views Education» more  CORR 2002»
13 years 7 months ago
Fair Stateless Aggregate Traffic Marking using Active Queue Management Techniques
Abstract--In heterogeneous networks such as today's Internet, the differentiated services architecture promises to provide QoS guarantees through scalable service differentiat...
Abhimanyu Das, Debojyoti Dutta, Ahmed Helmy
IPPS
2010
IEEE
13 years 5 months ago
On the parallelisation of MCMC by speculative chain execution
Abstract--The increasing availability of multi-core and multiprocessor architectures provides new opportunities for improving the performance of many computer simulations. Markov C...
Jonathan M. R. Byrd, Stephen A. Jarvis, Abhir H. B...
PDP
2008
IEEE
14 years 2 months ago
Behavioural Skeletons in GCM: Autonomic Management of Grid Components
Autonomic management can be used to improve the QoS provided by parallel/distributed applications. We discuss behavioural skeletons introduced in earlier work: rather than relying...
Marco Aldinucci, Sonia Campa, Marco Danelutto, Mar...
WINET
2010
224views more  WINET 2010»
13 years 6 months ago
Hierarchical geographic multicast routing for wireless sensor networks
Wireless sensor networks comprise typically dense deployments of large networks of small wireless capable sensor devices. In such networks, multicast is a fundamental routing servi...
Dimitrios Koutsonikolas, Saumitra M. Das, Y. Charl...