Sciweavers

2905 search results - page 169 / 581
» Formal Memetic Algorithms
Sort
View
ASAP
1997
IEEE
106views Hardware» more  ASAP 1997»
14 years 2 months ago
Libraries of schedule-free operators in Alpha
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 ...
Florent de Dinechin
MOVEP
2000
167views Hardware» more  MOVEP 2000»
14 years 1 months ago
Model Checking: A Tutorial Overview
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...
Stephan Merz
NAACL
2007
13 years 11 months ago
Relationship between Non-Projective Edges, Their Level Types, and Well-Nestedness
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 ...
Jirí Havelka
IJIT
2004
13 years 11 months ago
Resource Matching and a Matchmaking Service for an Intelligent Grid
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...
Xin Bai, Han Yu, Yongchang Ji, Dan C. Marinescu
ACL
1990
13 years 11 months ago
The Computational Complexity of Avoiding Conversational Implicatures
Referring expressions and other object descriptions should be maximal under the Local Brevity, No Unnecessary Components, and Lexical Preference preference rules; otherwise, they ...
Ehud Reiter