2520 search results - page 275 / 504 » The complexity of approximating entropy |
148
click to vote
IWINAC
2007
Springer
16 years 23 days ago
2007
Springer
One of the key points in Estimation of Distribution Algorithms (EDAs) is the learning of the probabilistic graphical model used to guide the search: the richer the model the more ...
173
click to vote
SMI
2005
IEEE
16 years 6 days ago
2005
IEEE
Complex implicit CSG models can be represented hierarchically as a tree of nodes (the BlobTree) . However, current methods cannot be used to visualize changes made to these models...
191
click to vote
ATAL
2005
Springer
16 years 5 days ago
2005
Springer
One of the difficulties to adapt MDPs for the control of cooperative multi-agent systems, is the complexity issued from Decentralized MDPs. Moreover, existing approaches can not ...
161
click to vote
ATAL
2004
Springer
16 years 20 hour ago
2004
Springer
Decentralized MDPs provide a powerful formal framework for planning in multi-agent systems, but the complexity of the model limits its usefulness. We study in this paper a class o...
192
click to vote
ECAI
2004
Springer
16 years 13 hour ago
2004
Springer
In the past, Markov Decision Processes (MDPs) have become a standard for solving problems of sequential decision under uncertainty. The usual request in this framework is the compu...