4419 search results - page 116 / 884 » Information Science in Transition |
121
Voted
SPIN
2007
Springer
15 years 9 months ago
2007
Springer
Verifying concurrent programs is challenging since the number of thread interleavings that need to be explored can be huge even for moderate programs. We present a cartesian semant...
128
Voted
RTA
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. For narrowing to be an efficient evaluation mechanism, several lazy narrowing strategies have been proposed, although typically for the restricted case of left-linear con...
129
Voted
CSCW
2000
ACM
15 years 8 months ago
2000
ACM
Companies are experimenting with putting teams into warrooms, hoping for some productivity enhancement. We conducted a field study of six such teams, tracking their activity, atti...
126
Voted
FOCS
1999
IEEE
15 years 8 months ago
1999
IEEE
We show that no Markovian Coupling argument can prove rapid mixing of the Jerrum-Sinclair Markov chain for sampling almost uniformly from the set of perfect and near perfect match...
130
Voted
CONCUR
1993
Springer
15 years 7 months ago
1993
Springer
cal Technique for Process Abstraction Glenn Bruns Department of Computer Science University of Edinburgh Edinburgh EH9 3JZ, UK Abstract. With algebraic laws a process can be simpli...