Sciweavers

636 search results - page 42 / 128
» Measuring Complexity of Intelligent Machines
Sort
View
77
Voted
CEC
2007
IEEE
15 years 1 months ago
Efficient relevance estimation and value calibration of evolutionary algorithm parameters
Calibrating the parameters of an evolutionary algorithm (EA) is a laborious task. The highly stochastic nature of an EA typically leads to a high variance of the measurements. The ...
Volker Nannen, A. E. Eiben
ATAL
2010
Springer
14 years 10 months ago
Self-organization for coordinating decentralized reinforcement learning
Decentralized reinforcement learning (DRL) has been applied to a number of distributed applications. However, one of the main challenges faced by DRL is its convergence. Previous ...
Chongjie Zhang, Victor R. Lesser, Sherief Abdallah
ECAI
2006
Springer
14 years 11 months ago
Calibrating Probability Density Forecasts with Multi-Objective Search
Abstract. In this paper, we show that the optimization of density forecasting models for regression in machine learning can be formulated as a multi-objective problem. We describe ...
Michael Carney, Padraig Cunningham
CEC
2005
IEEE
15 years 3 months ago
Effects of experience bias when seeding with prior results
Abstract- Seeding the population of an evolutionary algorithm with solutions from previous runs has proved to be useful when learning control strategies for agents operating in a c...
Mitchell A. Potter, R. Paul Wiegand, H. Joseph Blu...
SIGCSE
2005
ACM
102views Education» more  SIGCSE 2005»
15 years 3 months ago
Interpreting Java program runtimes
Many instructors use program runtimes to illustrate and reinforce algorithm complexity concepts. Hardware, operating system and compilers have historically influenced runtime resu...
Stuart A. Hansen