Sciweavers

476 search results - page 18 / 96
» Learning When to Use Lazy Learning in Constraint Solving
Sort
View
CP
2003
Springer
14 years 21 days ago
Semi-automatic Modeling by Constraint Acquisition
Constraint programming is a technology which is now widely used to solve combinatorial problems in industrial applications. However, using it requires considerable knowledge and e...
Remi Coletta, Christian Bessière, Barry O'S...
NIPS
2003
13 years 8 months ago
Ambiguous Model Learning Made Unambiguous with 1/f Priors
What happens to the optimal interpretation of noisy data when there exists more than one equally plausible interpretation of the data? In a Bayesian model-learning framework the a...
Gurinder S. Atwal, William Bialek
GECCO
2007
Springer
293views Optimization» more  GECCO 2007»
14 years 1 months ago
Solving the artificial ant on the Santa Fe trail problem in 20, 696 fitness evaluations
In this paper, we provide an algorithm that systematically considers all small trees in the search space of genetic programming. These small trees are used to generate useful subr...
Steffen Christensen, Franz Oppacher
CSREAEEE
2008
199views Business» more  CSREAEEE 2008»
13 years 9 months ago
Progranimate - A Web Enabled Algorithmic Problem Solving Application
- This paper proposes the use of an interactive web based problem solving application that utilises flowchart based programming and code generation to address the issues faced by n...
Andrew Scott, Mike Watkins, Duncan McPhee
ICMLA
2010
13 years 5 months ago
Classification Models with Global Constraints for Ordinal Data
Ordinal classification is a form of multi-class classification where there is an inherent ordering between the classes, but not a meaningful numeric difference between them. Althou...
Jaime S. Cardoso, Ricardo Sousa