620 search results - page 74 / 124 » Decidability Problems for Actor Systems |
CEC
2007
IEEE
15 years 4 months ago
2007
IEEE
Abstract— We present a novel algorithm for the onedimension offline bin packing problem with discrete item sizes based on the notion of matching the item-size histogram with the...
FSTTCS
2004
Springer
15 years 3 months ago
2004
Springer
The class of visibly pushdown languages has been recently defined as a subclass of context-free languages with desirable closure properties and tractable decision problems. We stu...
SAMOS
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. Loop unrolling plays an important role in compilation for Reconfigurable Processing Units (RPUs) as it exposes operator parallelism and enables other transformations (e.g...
ICALP
2010
Springer
15 years 2 months ago
2010
Springer
We show that the downward-closure of a Petri net language is effectively computable. This is mainly done by using the notions defined for showing decidability of the reachability...
TAPSOFT
1991
Springer
15 years 1 months ago
1991
Springer
Type inference can be phrased as constraint-solving over types. We consider an implicitly typed language equipped with recursive types, multiple inheritance, 1st order parametric ...