4940 search results - page 679 / 988 » On the Complexity of Universal Programs |
153
click to vote
ICLP
1999
Springer
15 years 11 months ago
1999
Springer
In this paper, we focus on the problem of existence of and computing small and large stable models. We show that for every xed integer k, there is a linear-time algorithm to decid...
144
click to vote
HICSS
1998
IEEE
15 years 11 months ago
1998
IEEE
The National Institute of Standards and Technology (NIST) has developed a form-based handprint recognition system for reading information written on forms. This public domain soft...
168
click to vote
HPCA
1998
IEEE
15 years 11 months ago
1998
IEEE
As we look to the future, and the prospect of a billion transistors on a chip, it seems inevitable that microprocessors will exploit having multiple parallel threads. To achieve t...
187
click to vote
ICCL
1998
IEEE
15 years 11 months ago
1998
IEEE
On-line partial evaluators are hardly ever selfapplicable, because the complexity of deciding whether to residualize terms causes combinatorial explosion when self-application is ...
178
click to vote
PPDP
1999
Springer
15 years 11 months ago
1999
Springer
For a compiler writer, generating good machine code for a variety of platforms is hard work. One might try to reuse a retargetable code generator, but code generators are complex a...