Sciweavers

2905 search results - page 395 / 581
» Formal Memetic Algorithms
Sort
View
152
Voted
GECCO
2006
Springer
156views Optimization» more  GECCO 2006»
15 years 7 months ago
Probabilistic modeling for continuous EDA with Boltzmann selection and Kullback-Leibeler divergence
This paper extends the Boltzmann Selection, a method in EDA with theoretical importance, from discrete domain to the continuous one. The difficulty of estimating the exact Boltzma...
Yunpeng Cai, Xiaomin Sun, Peifa Jia
POPL
1991
ACM
15 years 7 months ago
Coordinating First-Order Multiparty Interactions
-order multiparty interaction is an abstraction mechanism that defines communication among a set of formal process roles. Actual processes participate in a first-order interactio...
Yuh-Jzer Joung, Scott A. Smolka
GECCO
2010
Springer
153views Optimization» more  GECCO 2010»
15 years 7 months ago
Multi-task evolutionary shaping without pre-specified representations
Shaping functions can be used in multi-task reinforcement learning (RL) to incorporate knowledge from previously experienced tasks to speed up learning on a new task. So far, rese...
Matthijs Snel, Shimon Whiteson
155
Voted
AAAI
2008
15 years 6 months ago
HTN-MAKER: Learning HTNs with Minimal Additional Knowledge Engineering Required
We describe HTN-MAKER, an algorithm for learning hierarchical planning knowledge in the form of decomposition methods for Hierarchical Task Networks (HTNs). HTNMAKER takes as inpu...
Chad Hogg, Héctor Muñoz-Avila, Ugur ...
AAAI
2008
15 years 6 months ago
Using Reasoning Patterns to Simplify Games
In complex strategic situations decision-making agents interact with many other agents and have access to many pieces of information throughout their play. This usually leads to g...
Dimitrios Antos, Avi Pfeffer