2694 search results - page 448 / 539 » Fully Distributed Algorithms for Convex Optimization Problem... |
GECCO
2006
Springer
15 years 1 months ago
2006
Springer
The representation used by a learning algorithm introduces a bias which is more or less well-suited to any given learning problem. It is well known that, across all possible probl...
GECCO
2007
Springer
15 years 4 months ago
2007
Springer
Generating a random sampling of program trees with specified function and terminal sets is the initial step of many program evolution systems. I present a theoretical and experim...
GECCO
2010
Springer
15 years 2 months ago
2010
Springer
This paper argues that multiagent learning is a potential “killer application” for generative and developmental systems (GDS) because key challenges in learning to coordinate ...
101
click to vote
GECCO
2006
Springer
15 years 1 months ago
2006
Springer
In some cases, evolutionary algorithms represent individuals as typical binary trees with n leaves and n-1 internal nodes. When designing a crossover operator for a particular rep...
103
click to vote
ATAL
2006
Springer
14 years 11 months ago
2006
Springer
Bidding for multiple items or bundles on online auctions raises challenging problems. We assume that an agent has a valuation function that returns its valuation for an arbitrary ...