Sciweavers

444 search results - page 36 / 89
» Termination by Abstraction
Sort
View
GECCO
2005
Springer
133views Optimization» more  GECCO 2005»
14 years 2 months ago
Parsing and translation of expressions by genetic programming
We have investigated the potential for using genetic programming to evolve compiler parsing and translation routines for processing arithmetic and logical expressions as they are ...
David Jackson
ICIC
2005
Springer
14 years 2 months ago
Orthogonal Forward Selection for Constructing the Radial Basis Function Network with Tunable Nodes
Abstract. An orthogonal forward selection (OFS) algorithm based on the leaveone-out (LOO) criterion is proposed for the construction of radial basis function (RBF) networks with tu...
Sheng Chen, Xia Hong, Chris J. Harris
ESA
2004
Springer
97views Algorithms» more  ESA 2004»
14 years 2 months ago
Radio Network Clustering from Scratch
Abstract. We propose a novel randomized algorithm for computing a dominating set based clustering in wireless ad-hoc and sensor networks. The algorithm works under a model which ca...
Fabian Kuhn, Thomas Moscibroda, Roger Wattenhofer
LOPSTR
2004
Springer
14 years 2 months ago
Declarative Semantics of Input Consuming Logic Programs
Most logic programming languages actually provide some kind of dynamic scheduling to increase the expressive power and to control execution. Input consuming derivations have been i...
Annalisa Bossi, Nicoletta Cocco, Sandro Etalle, Sa...
CIE
2010
Springer
14 years 1 months ago
Higher-Order Containers
Containers are a semantic way to talk about strictly positive types. In previous work it was shown that containers are closed under various constructions including products, coprod...
Thorsten Altenkirch, Paul Levy, Sam Staton