Sciweavers

612 search results - page 62 / 123
» An Empirical Study of Agent Programs
Sort
View
JMLR
2006
145views more  JMLR 2006»
13 years 9 months ago
Ensemble Pruning Via Semi-definite Programming
An ensemble is a group of learning models that jointly solve a problem. However, the ensembles generated by existing techniques are sometimes unnecessarily large, which can lead t...
Yi Zhang 0006, Samuel Burer, W. Nick Street
GECCO
2004
Springer
14 years 2 months ago
On the Strength of Size Limits in Linear Genetic Programming
Abstract. Bloat is a common and well studied problem in genetic programming. Size and depth limits are often used to combat bloat, but to date there has been little detailed explor...
Nicholas Freitag McPhee, Alex Jarvis, Ellery Fusse...
AAAI
2007
13 years 11 months ago
Forgetting Actions in Domain Descriptions
Forgetting irrelevant/problematic actions in a domain description can be useful in solving reasoning problems, such as query answering, planning, conflict resolution, prediction,...
Esra Erdem, Paolo Ferraris
CSCLP
2004
Springer
14 years 2 months ago
Automatically Exploiting Symmetries in Constraint Programming
We introduce a framework for studying and solving a class of CSP formulations. The framework allows constraints to be expressed as linear and nonlinear equations, then compiles th...
Arathi Ramani, Igor L. Markov
WCRE
1997
IEEE
14 years 1 months ago
Program Plan Recognition for Year 2000 Tools
There are many commercial tools that address various aspects of the Year 2000 problem. None of these tools, however, addresses the closely-related leap-year problem. In this paper...
Arie van Deursen, Steven Woods, Alex Quilici