2905 search results - page 169 / 581 » Formal Memetic Algorithms |
115
click to vote
ASAP
1997
IEEE
15 years 7 months ago
1997
IEEE
This paper presents a method, based on the formalism of affine recurrence equations, for the synthesis of digital circuits exploiting parallelism at the bit-level. In the initial ...
153
Voted
MOVEP
2000
15 years 6 months ago
2000
We survey principles of model checking techniques for the automatic analysis of reactive systems. The use of model checking is exemplified by an analysis of the Needham-Schroeder p...
115
click to vote
NAACL
2007
15 years 4 months ago
2007
Dependency analysis of natural language gives rise to non-projective structures. The constraint of well-nestedness on dependency trees has been recently shown to give a good fit ...
107
click to vote
IJIT
2004
15 years 4 months ago
2004
We discuss the application of matching in the area of resource discovery and resource allocation in grid computing. We present a formal definition of matchmaking, overview algorith...
150
click to vote
ACL
1990
15 years 4 months ago
1990
Referring expressions and other object descriptions should be maximal under the Local Brevity, No Unnecessary Components, and Lexical Preference preference rules; otherwise, they ...