828 search results - page 104 / 166 » Bounded Hairpin Completion |
SPAA
2006
ACM
15 years 10 months ago
2006
ACM
This paper investigates time-efficient implementations of atomic read-write registers in message-passing systems where the number of readers can be unbounded. In particular we st...
150
Voted
SPAA
2005
ACM
15 years 10 months ago
2005
ACM
We describe a new class of utility-maximization scheduling problem with precedence constraints, the disconnected staged scheduling problem (DSSP). DSSP is a nonpreemptive multipro...
139
click to vote
SIGUCCS
2003
ACM
15 years 9 months ago
2003
ACM
IT Training and Communications is a division of Information Technology Services (ITS), which provides computer application training for the faculty and staff at Saint Louis Univer...
162
click to vote
KR
2010
Springer
15 years 9 months ago
2010
Springer
Horn fragments of Description Logics (DLs) have gained popularity because they provide a beneficial trade-off between expressive power and computational complexity and, more spec...
121
click to vote
ESOP
2001
Springer
15 years 9 months ago
2001
Springer
Constant propagation (CP) is one of the most widely used optimizations in practice (cf. [9]). Intuitively, it addresses the problem of statically detecting whether an expression al...