949 search results - page 82 / 190 » Programmed Mutagenesis Is Universal |
119
click to vote
AHS
2007
IEEE
15 years 10 months ago
2007
IEEE
This paper reviews the current state of the art in highperformance reconfigurable computing (HPRC) from the perspective of EPCC, the high-performance computing centre at the Unive...
119
click to vote
GRC
2007
IEEE
15 years 10 months ago
2007
IEEE
— Granular computing unifies structured thinking, structured problem solving and structured information processing. In order to see the flexibility and universal applicability ...
142
click to vote
CC
2004
Springer
15 years 9 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...
119
Voted
CSL
2004
Springer
15 years 9 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...
162
click to vote
ACMMPC
2000
Springer
15 years 8 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 ...