Sciweavers

1897 search results - page 252 / 380
» Mining Chains of Relations
Sort
View
DMSN
2010
ACM
15 years 4 months ago
Facilitating fine grained data provenance using temporal data model
E-science applications use fine grained data provenance to maintain the reproducibility of scientific results, i.e., for each processed data tuple, the source data used to proce...
Mohammad Rezwanul Huq, Andreas Wombacher, Peter M....
IANDC
2010
116views more  IANDC 2010»
15 years 4 months ago
Weak bisimulation is sound and complete for pCTL*
Abstract. We investigate weak bisimulation of probabilistic systems in the presence of nondeterminism, i.e. labelled concurrent Markov chains (LCMC) with silent transitions. We bui...
Josée Desharnais, Vineet Gupta, Radha Jagad...
IEEEHPCS
2010
15 years 4 months ago
An experimental study of greedy routing algorithms
The “small world” phenomenon, i.e., the fact that the global social network is strongly connected in the sense that every two persons are inter-related through a small chain o...
Stavros Athanassopoulos, Christos Kaklamanis, Ilia...
157
Voted
IOR
2010
100views more  IOR 2010»
15 years 4 months ago
Integrated Production and Outbound Distribution Scheduling: Review and Extensions
In many applications involving make-to-order or time-sensitive (e.g., perishable, seasonal) products, finished orders are often delivered to customers immediately or shortly after...
Zhi-Long Chen
156
Voted
FMICS
2010
Springer
15 years 4 months ago
A Study of Shared-Memory Mutual Exclusion Protocols Using CADP
Mutual exclusion protocols are an essential building block of concurrent systems: indeed, such a protocol is required whenever a shared resource has to be protected against concurr...
Radu Mateescu, Wendelin Serwe