4940 search results - page 236 / 988 » On the Complexity of Universal Programs |
146
click to vote
GRC
2007
IEEE
16 years 26 days ago
2007
IEEE
— Granular computing unifies structured thinking, structured problem solving and structured information processing. In order to see the flexibility and universal applicability ...
172
click to vote
CC
2004
Springer
15 years 12 months ago
2004
Springer
We present an algorithm for counting the number of integer solutions to selected free variables of a Presburger formula. We represent the Presburger formula as a deterministic fin...
152
click to vote
CSL
2004
Springer
15 years 12 months ago
2004
Springer
Set constraints are a useful formalism for verifying properties of programs. Usually, they are interpreted over the universe of finite terms. However, some logic languages allow i...
196
click to vote
ACMMPC
2000
Springer
15 years 11 months ago
2000
Springer
Fixed point calculus is about the solution of recursive equations de˛ned by a monotonic endofunction on a partially ordered set. This tutorial presents the basic theory of ˛xed ...
195
click to vote
SPDP
1993
IEEE
15 years 10 months ago
1993
IEEE
This paper examines how the performance of a shared-memory multiprocessor can be improved by including hardware support for block transfers. A system similar to the Hector multipr...