4498 search results - page 232 / 900 » How to Invent Functions |
137
click to vote
GECCO
2009
Springer
15 years 11 months ago
2009
Springer
In this paper, we rigorously analyse how the magnitude and frequency of change may affect the performance of the algorithm (1+1) EAdyn on a set of artificially designed pseudo-Bo...
256
click to vote
AIEDAM
2011
14 years 11 months ago
2011
In familiar design domains, expert designers are able to quickly focus on “good designs”, based on constraints they have learned while exploring the design space. This ability ...
136
click to vote
AMAI
2004
Springer
15 years 10 months ago
2004
Springer
The majority of the work in the area of Markov decision processes has focused on expected values of rewards in the objective function and expected costs in the constraints. Althou...
157
Voted
VISUALIZATION
1994
IEEE
15 years 8 months ago
1994
IEEE
We will try to address the need for a formal foundation for visualization by taking an analytic approach to defining D. Since an arbitrary function D: U V will not produce display...
120
Voted
ICML
2009
IEEE
16 years 5 months ago
2009
IEEE
This paper presents a theoretical framework for ranking, and demonstrates how to perform generalization analysis of listwise ranking algorithms using the framework. Many learning-...