Sciweavers

2089 search results - page 200 / 418
» Finding Environment Guarantees
Sort
View
CAV
2008
Springer
108views Hardware» more  CAV 2008»
15 years 6 months ago
Reducing Concurrent Analysis Under a Context Bound to Sequential Analysis
This paper addresses the analysis of concurrent programs with shared memory. Such an analysis is undecidable in the presence of multiple procedures. One approach used in recent wor...
Akash Lal, Thomas W. Reps
134
Voted
ECOWS
2006
Springer
15 years 6 months ago
Parallel Web Service Composition in MoSCoE: A Choreography-Based Approach
We present a goal-driven approach to model a choreographer for realizing composite Web services. In this framework, the users start with an abstract, and possibly incomplete funct...
Jyotishman Pathak, Samik Basu, Robyn R. Lutz, Vasa...
139
Voted
CPAIOR
2008
Springer
15 years 6 months ago
Optimal Deployment of Eventually-Serializable Data Services
Abstract. Replication is a fundamental technique for increasing throughput and achieving fault tolerance in distributed data services. However, its implementation may induce signif...
Laurent Michel, Alexander A. Shvartsman, Elaine L....
152
Voted
ALENEX
2008
142views Algorithms» more  ALENEX 2008»
15 years 6 months ago
Consensus Clustering Algorithms: Comparison and Refinement
Consensus clustering is the problem of reconciling clustering information about the same data set coming from different sources or from different runs of the same algorithm. Cast ...
Andrey Goder, Vladimir Filkov
142
Voted
CCCG
2008
15 years 6 months ago
Memory Requirements for Local Geometric Routing and Traversal in Digraphs
Local route discovery in geometric, strongly connected, undirected plane graphs is guaranteed by the Face Routing algorithm. The algorithm is local and geometric in the sense that...
Maia Fraser, Evangelos Kranakis, Jorge Urrutia