Sciweavers

34 search results - page 3 / 7
» The Dense Simple Sets are Orbit Complete with Respect to the...
Sort
View
APLAS
2000
ACM
13 years 11 months ago
A Generalization of Hybrid Let-Polymorphic Type Inference Algorithms
We present a generalized let-polymorphic type inference algorithm, prove that any of its instances is sound and complete with respect to the Hindley/Milner let-polymorphic type sy...
Oukseh Lee, Kwangkeun Yi
DAM
2010
112views more  DAM 2010»
13 years 6 months ago
New results on optimizing rooted triplets consistency
Abstract. A set of phylogenetic trees with overlapping leaf sets is consistent if it can be merged without conflicts into a supertree. In this paper, we study the polynomial-time a...
Jaroslaw Byrka, Sylvain Guillemot, Jesper Jansson
IJON
2000
71views more  IJON 2000»
13 years 6 months ago
Variable selection using neural-network models
In this paper we propose an approach to variable selection that uses a neural-network model as the tool to determine which variables are to be discarded. The method performs a bac...
Giovanna Castellano, Anna Maria Fanelli
JLP
2000
134views more  JLP 2000»
13 years 6 months ago
Abducing through negation as failure: stable models within the independent choice logic
The independent choice logic (ICL) is part of a project to combine logic and decision/game theory into a coherent framework. The ICL has a simple possible-worlds semantics charact...
David Poole
JAT
2011
93views more  JAT 2011»
13 years 1 months ago
Approximation theorems for group valued functions
Stone-Weierstrass-type theorems for groups of group-valued functions with discrete range or discrete domain are obtained. We study criteria for a subgroup of the group of continuou...
Jorge Galindo, Manuel Sanchis