Abstract. We define a probabilistic contract framework for the construction of component-based embedded systems, based on the theory of Interactive Markov Chains. A contract specif...
Given the sequential implementation of any data structure, we show how to obtain an efficient, wait-free implementation of that data structure shared by any fixed number of proces...
The amount of textual data that is available for researchers and businesses to analyze is increasing at a dramatic rate. This reality has led IS researchers to investigate various...
Sangno Lee, Jeff Baker, Jaeki Song, James C. Wethe...
This paper introduces a new algorithm for solving a subclass of quantified constraint satisfaction problems (QCSP) where existential quantifiers precede universally quantified ine...
Alexandre Goldsztejn, Claude Michel, Michel Rueher
Abstract In this paper, the use of queueing theory for modeling uninterrupted traffic flows is evaluated. Empirical data on speeds and flows are used to evaluate speeds generated b...