Sciweavers

261 search results - page 51 / 53
» Proof Normalization Modulo
Sort
View
GECCO
2008
Springer
145views Optimization» more  GECCO 2008»
13 years 8 months ago
Threshold selecting: best possible probability distribution for crossover selection in genetic algorithms
The paper considers the problem of selecting individuals in the current population in Genetic Algorithms for crossover to find a solution of high fitness of a given combinatoria...
Jörg Lässig, Karl Heinz Hoffmann, Mihael...
JACM
2007
84views more  JACM 2007»
13 years 7 months ago
Polymorphic higher-order recursive path orderings
This paper extends the termination proof techniques based on reduction orderings to a higher-order setting, by defining a family of recursive path orderings for terms of a typed ...
Jean-Pierre Jouannaud, Albert Rubio
JACM
2000
81views more  JACM 2000»
13 years 7 months ago
Relational queries over interpreted structures
We rework parts of the classical relational theory when the underlying domain is a structure with some interpreted operations that can be used in queries. We identify parts of the...
Michael Benedikt, Leonid Libkin
JISE
1998
84views more  JISE 1998»
13 years 7 months ago
Determining the Idle Time of a Tiling: New Results
In the framework of perfect loop nests with uniform dependences, tiling has been extensively studied as a source-to-source program transformation. We build upon recent results by ...
Frederic Desprez, Jack Dongarra, Fabrice Rastello,...
IS
2010
13 years 5 months ago
Extracting a largest redundancy-free XML storage structure from an acyclic hypergraph in polynomial time
Given a hypergraph and a set of embedded functional dependencies, we investigate the problem of determining the conditions under which we can efficiently generate redundancy-free ...
Wai Yin Mok, Joseph Fong, David W. Embley