4940 search results - page 132 / 988 » On the Complexity of Universal Programs |
158
click to vote
ICCAD
1992
IEEE
15 years 8 months ago
1992
IEEE
In this paper we describe combining a mesh analysis equation formulation technique with a preconditioned GORES matrix solution algorithm to accelerate the determination of inducta...
144
click to vote
WSC
1996
15 years 6 months ago
1996
Eight successively refined simulation models for the earthmoving operations involved in the construction of a dam provide the foundation for illustrating the ease and effectivenes...
135
click to vote
APAL
2006
15 years 4 months ago
2006
This paper studies the complexity of behavior of multi-agent systems. Behavior properties are formulated using classical temporal logic languages and are checked with respect to t...
134
click to vote
ICALP
1998
Springer
15 years 9 months ago
1998
Springer
Abstract. We study entailment of structural and nonstructural recursive subtyping constraints. Constraints are formal inequalities between type expressions, interpreted over an ord...
144
click to vote
GECCO
2006
Springer
15 years 8 months ago
2006
Springer
1 Learnable Evolution Model (LEM) is a form of non-Darwinian evolutionary computation that employs machine learning to guide evolutionary processes. Its main novelty are new type o...