426 search results - page 25 / 86 » Run lengths and liquidity |
ICALP
2004
Springer
14 years 3 months ago
2004
Springer
We give a simple formulation of Karr’s algorithm for computing all affine relationships in affine programs. This simplified algorithm runs in time O(nk3 ) where n is the progr...
CPM
2007
Springer
14 years 1 months ago
2007
Springer
This paper considers enumeration of substring equivalence classes introduced by Blumer et al. [1]. They used the equivalence classes to define an index structure called compact dir...
CAV
2008
Springer
13 years 12 months ago
2008
Springer
We study the problem of monitoring concurrent program runs for atomicity violations. Unearthing fundamental results behind scheduling algorithms in database control, we build space...
IJCAI
2007
13 years 11 months ago
2007
Abstract. In this paper, nogood recording is investigated for CSP within the randomization and restart framework. Our goal is to avoid the same situations to occur from one run to ...
WSC
2004
13 years 11 months ago
2004
Assembly lines with closed loop parallel lanes have the potential to continue to be productive when individual stations breakdown. A requirement in such parallel lane systems is t...