Sciweavers

120 search results - page 14 / 24
» Parallel Algorithm for Concurrent Computation of Connected C...
Sort
View
CONCUR
2000
Springer
14 years 5 days ago
Weak Bisimulation for Probabilistic Systems
Abstract. In this paper, we introduce weak bisimulation in the framework of Labeled Concurrent Markov Chains, that is, probabilistic transition systems which exhibit both probabili...
Anna Philippou, Insup Lee, Oleg Sokolsky
ISPDC
2008
IEEE
14 years 2 months ago
Algorithms for Network Topology Discovery using End-to-End Measurements
Identifying and inferring performances of a network topology is a well known problem. Achieving this by using only end-to-end measurements at the application level is a method kno...
Laurent Bobelin, Traian Muntean
PVLDB
2010
190views more  PVLDB 2010»
13 years 2 months ago
Efficient B-tree Based Indexing for Cloud Data Processing
A Cloud may be seen as a type of flexible computing infrastructure consisting of many compute nodes, where resizable computing capacities can be provided to different customers. T...
Sai Wu, Dawei Jiang, Beng Chin Ooi, Kun-Lung Wu
JSC
2010
96views more  JSC 2010»
13 years 6 months ago
On a generalization of Stickelberger's Theorem
We prove two versions of Stickelberger’s Theorem for positive dimensions and use them to compute the connected and irreducible components of a complex algebraic variety. If the ...
Peter Scheiblechner
HPDC
2007
IEEE
14 years 2 months ago
Peer-to-peer checkpointing arrangement for mobile grid computing systems
This paper deals with a novel, distributed, QoS-aware, peer-topeer checkpointing arrangement component for mobile Grid (MoG) computing systems middleware. Checkpointing is more cr...
Paul J. Darby III, Nian-Feng Tzeng