200
click to vote
ICTCS
2003
Springer
16 years 14 days ago
2003
Springer
Abstract. Given two proofs in a logical system with a confluent cutelimination procedure, the cut-elimination problem (CEP) is to decide whether these proofs reduce to the same no...
148
Voted
ICTCS
2003
Springer
16 years 14 days ago
2003
Springer
174
click to vote
ICTCS
2003
Springer
16 years 14 days ago
2003
Springer
In this paper, we study the problem of cost constrained fixed job scheduling (CCFJS). In this problem, there are a number of processors, each of which belongs to one of several cla...
193
click to vote
ICTCS
2003
Springer
16 years 14 days ago
2003
Springer
The algebraic models of computation for contextual nets that have been proposed in the literature either rely on a non-free monoid of objects, or introduce too many fictitious beh...
188
Voted
ICTCS
2003
Springer
16 years 14 days ago
2003
Springer
We define a calculus for modeling dynamic linking independently of the details of a particular programming environment. The calculus distinguishes at the language level the notion...