2181 search results - page 178 / 437 » The restriction scaffold problem |
116
click to vote
ICTCS
2003
Springer
15 years 6 months 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...
109
Voted
PODS
2010
ACM
15 years 6 months ago
2010
ACM
We investigate a higher-order query language that embeds operators of the positive relational algebra within the simply-typed λ-calculus. Our language allows one to succinctly de...
RTSS
2002
IEEE
15 years 6 months ago
2002
IEEE
The schedulability analysis problem for many realistic task models is intractable. Therefore known algorithms either have exponential complexity or at best can be solved in pseudo...
HICSS
2000
IEEE
15 years 5 months ago
2000
IEEE
Multi-site scheduling deals with the scheduling problems of an enterprise with several distributed production sites, where sites are using the intermediate products of other sites...
ALT
1999
Springer
15 years 5 months ago
1999
Springer
Abstract. Blum and Blum (1975) showed that a class B of suitable recursive approximations to the halting problem is reliably EX-learnable. These investigations are carried on by sh...