Sciweavers

2436 search results - page 340 / 488
» Comonadic Notions of Computation
Sort
View
TCS
2010
15 years 2 months ago
Contract-based discovery of Web services modulo simple orchestrators
Web services are distributed processes with a public description of their behavior, or contract. The availability of repositories of Web service descriptions enables interesting f...
Luca Padovani
132
Voted
IPPS
2010
IEEE
15 years 2 months ago
Oblivious algorithms for multicores and network of processors
We address the design of algorithms for multicores that are oblivious to machine parameters. We propose HM, a multicore model consisting of a parallel shared-memory machine with hi...
Rezaul Alam Chowdhury, Francesco Silvestri, Brando...
TGC
2010
Springer
15 years 2 months ago
Uniform Labeled Transition Systems for Nondeterministic, Probabilistic, and Stochastic Processes
Rate transition systems (RTS) are a special kind of transition systems introduced for defining the stochastic behavior of processes and for associating continuous-time Markov chain...
Marco Bernardo, Rocco De Nicola, Michele Loreti
VSTTE
2010
Springer
15 years 2 months ago
An Approach of Requirements Tracing in Formal Refinement
Formal modeling of computing systems yields models that are intended to be correct with respect to the requirements that have been formalized. The complexity of typical computing s...
Michael Jastram, Stefan Hallerstede, Michael Leusc...
CSE
2009
IEEE
15 years 2 months ago
Edge Anonymity in Social Network Graphs
Edges in social network graphs can model sensitive relationships. In this paper, we consider the problem of edges anonymity in graphs. We propose a probabilistic notion of edge ano...
Lijie Zhang, Weining Zhang