Sciweavers

1743 search results - page 136 / 349
» Generalized Modal Satisfiability
Sort
View
HOA
1993
15 years 7 months ago
Strong Normalization of Typeable Rewrite Systems
This paper studies termination properties of rewrite systems that are typeable using intersection types. It introduces a notion of partial type assignment on Curryfied Term Rewri...
Steffen van Bakel, Maribel Fernández
EUROCRYPT
1990
Springer
15 years 7 months ago
Propagation Characteristics of Boolean Functions
The relation between the Walsh-Hadamard transform and the autocorrelation function of Boolean functions is used to study propagation characteristics of these functions. The Strict...
Bart Preneel, Werner Van Leekwijck, Luc Van Linden...
87
Voted
ECAI
2006
Springer
15 years 7 months ago
Unified Definition of Heuristics for Classical Planning
In many types of planning algorithms distance heuristics play an important role. Most of the earlier works restrict to STRIPS operators, and their application to a more general lan...
Jussi Rintanen
123
Voted
GECCO
2000
Springer
150views Optimization» more  GECCO 2000»
15 years 7 months ago
Automatic Synthesis of Electrical Circuits Containing a Free Variable Using Genetic Programming
A mathematical formula containing one or more free variables is "general" in the sense that it represents the solution to all instances of a problem (instead of just the...
John R. Koza, Martin A. Keane, Jessen Yu, William ...
122
Voted
CIE
2008
Springer
15 years 5 months ago
Interpreting Localized Computational Effects Using Operators of Higher Type
d abstract) John Longley Laboratory for Foundations of Computer Science School of Informatics, University of Edinburgh The King's Buildings, Mayfield Road Edinburgh EH9 3JZ, U...
John Longley