Sciweavers

2126 search results - page 103 / 426
» An optimization algorithm for imprecise multi-objective prob...
Sort
View
APPML
2002
58views more  APPML 2002»
15 years 4 months ago
Layered clusters of tightness set functions
A method for structural clustering is proposed involving data on subset-to-entity linkages that can be calculated with structural data such as graphs or sequences or images. The m...
Boris Mirkin, Ilya B. Muchnik
ESANN
2001
15 years 6 months ago
Learning fault-tolerance in Radial Basis Function Networks
This paper describes a method of supervised learning based on forward selection branching. This method improves fault tolerance by means of combining information related to general...
Xavier Parra, Andreu Català
UAI
2004
15 years 6 months ago
Compact Value-Function Representations for Qualitative Preferences
We consider the challenge of preference elicitation in systems that help users discover the most desirable item(s) within a given database. Past work on preference elicitation foc...
Ronen I. Brafman, Carmel Domshlak, Tanya Kogan
GECCO
2011
Springer
276views Optimization» more  GECCO 2011»
14 years 8 months ago
Evolution of reward functions for reinforcement learning
The reward functions that drive reinforcement learning systems are generally derived directly from the descriptions of the problems that the systems are being used to solve. In so...
Scott Niekum, Lee Spector, Andrew G. Barto
GECCO
2008
Springer
139views Optimization» more  GECCO 2008»
15 years 5 months ago
Coordinate change operators for genetic algorithms
This paper studies the issue of space coordinate change in genetic algorithms, based on two methods: convex quadratic approximations, and principal component analysis. In both met...
Elizabeth F. Wanner, Eduardo G. Carrano, Ricardo H...