Sciweavers

91 search results - page 17 / 19
» Information-theoretic approaches to branching in search
Sort
View
SAC
2009
ACM
15 years 4 months ago
On a discretizable subclass of instances of the molecular distance geometry problem
The molecular distance geometry problem can be formulated as the problem of finding an immersion in R3 of a given undirected, nonnegatively weighted graph G. In this paper, we di...
Carlile Lavor, Leo Liberti, Antonio Mucherino, Nel...
ICANN
2010
Springer
14 years 10 months ago
Exploring Continuous Action Spaces with Diffusion Trees for Reinforcement Learning
We propose a new approach for reinforcement learning in problems with continuous actions. Actions are sampled by means of a diffusion tree, which generates samples in the continuou...
Christian Vollmer, Erik Schaffernicht, Horst-Micha...
PEPM
2007
ACM
15 years 3 months ago
Poly-controlled partial evaluation in practice
Poly-Controlled Partial Evaluation (PCPE) is a powerful approach to partial evaluation, which has recently been proposed. PCPE takes into account sets of control strategies instea...
Claudio Ochoa, Germán Puebla
AAAI
2010
14 years 11 months ago
Multi-Agent Plan Recognition: Formalization and Algorithms
Multi-Agent Plan Recognition (MAPR) seeks to identify the dynamic team structures and team behaviors from the observations of the activity-sequences of a set of intelligent agents...
Bikramjit Banerjee, Landon Kraemer, Jeremy Lyle
ATAL
2010
Springer
14 years 10 months ago
Coalition structure generation in multi-agent systems with mixed externalities
Coalition structure generation (CSG) for multi-agent systems is a well-studied problem. A vast majority of the previous work and the state-of-the-art approaches to CSG assume a ch...
Bikramjit Banerjee, Landon Kraemer