Sciweavers

400 search results - page 27 / 80
» What Makes a Problem GP-Hard
Sort
View
GECCO
2007
Springer
166views Optimization» more  GECCO 2007»
14 years 2 months ago
Understanding particle swarms through simplification: a study of recombinant PSO
Simplified forms of the particle swarm algorithm are very beneficial in contributing to understanding of what makes a PSO swarm function in the way that it does. One of these form...
Daniel Bratton, Tim Blackwell
CL
2000
Springer
14 years 2 months ago
FLORA: Implementing an Efficient DOOD System Using a Tabling Logic Engine
This paper reports on the design and implementation of FLORA -- a powerful DOOD system that incorporates the features of F-logic, HiLog, and Transaction Logic. FLORA is implemented...
Guizhen Yang, Michael Kifer
NIPS
2007
14 years 8 days ago
Active Preference Learning with Discrete Choice Data
We propose an active learning algorithm that learns a continuous valuation model from discrete preferences. The algorithm automatically decides what items are best presented to an...
Eric Brochu, Nando de Freitas, Abhijeet Ghosh
DAGSTUHL
2003
14 years 7 days ago
The Autotelic Principle
— The paper focuses on the problem how a community of distributed agents may autonomously invent and coordinate lexicons and grammars. Although our earlier experiments have shown...
Luc Steels
LISA
2004
14 years 7 days ago
PatchMaker: A Physical Network Patch Manager Tool
PatchMaker is a network management tool that tracks and stores descriptions of physical network patches in a database. Physical patches are cables that connect switches, patch pan...
Joseph R. Crouthamel, James M. Roberts, Christophe...