Sciweavers

53 search results - page 5 / 11
» Generating Propagators for Finite Set Constraints
Sort
View
FLAIRS
2008
13 years 9 months ago
Conditional and Composite Constraints with Preferences
Preferences in constraint problems are common but significant in many real world applications. In this paper, we extend our conditional and composite CSP (CCCSP) framework, managi...
Malek Mouhoub, Amrudee Sukpan
ICALP
1998
Springer
13 years 11 months ago
Constraint Automata and the Complexity of Recursive Subtype Entailment
Abstract. We study entailment of structural and nonstructural recursive subtyping constraints. Constraints are formal inequalities between type expressions, interpreted over an ord...
Fritz Henglein, Jakob Rehof
NAACL
1994
13 years 8 months ago
Phonological Parsing for Bi-directional Letter-to-Sound/Sound-to-Letter Generation
In this paper, we describe a reversibleletter-to-sound/soundto-letter generation system based on an approach which combines a rule-based formalism with data-driven techniques. We ...
Helen M. Meng, Stephanie Seneff, Victor Zue
ML
2002
ACM
127views Machine Learning» more  ML 2002»
13 years 7 months ago
Sparse Regression Ensembles in Infinite and Finite Hypothesis Spaces
We examine methods for constructing regression ensembles based on a linear program (LP). The ensemble regression function consists of linear combinations of base hypotheses generat...
Gunnar Rätsch, Ayhan Demiriz, Kristin P. Benn...
AAAI
1998
13 years 8 months ago
Inferring State Constraints for Domain-Independent Planning
Wedescribe somenewpreprocessing techniques that enable faster domain-independentplanning. Thefirst set of techniquesis aimedat inferring state constraints from the structure of pl...
Alfonso Gerevini, Lenhart K. Schubert