71 search results - page 7 / 15 » Foundations of Timed Concurrent Constraint Programming |
184
Voted
POPL
2009
ACM
16 years 8 days ago
2009
ACM
Deadlock in multithreaded programs is an increasingly important problem as ubiquitous multicore architectures force parallelization upon an ever wider range of software. This pape...
101
Voted
PLDI
2012
ACM
13 years 2 months ago
2012
ACM
Modern architectures implement relaxed memory models which may reorder memory operations or execute them non-atomically. Special instructions called memory fences are provided, al...
COMPGEOM
1992
ACM
15 years 3 months ago
1992
ACM
We present a simple randomized algorithm which solves linear programs with n constraints and d variables in expected minfO(d 22dn); e 2 pdln(n= p d)+O( p d+lnn)g time in the unit ...
87
Voted
DFT
2003
IEEE
15 years 5 months ago
2003
IEEE
1 This paper presents a solution to the test time minimization problem for core-based systems that contain sequential cores with STUMPS architecture. We assume a hybrid BIST approa...
183
Voted
POPL
2002
ACM
15 years 12 months ago
2002
ACM
Functional logic overloading is a novel approach to userdefined overloading that extends Haskell's concept of type classes in significant ways. Whereas type classes are conce...