Sciweavers

4781 search results - page 205 / 957
» Complexity at large
Sort
View
ICC
2007
IEEE
14 years 5 months ago
Computing Maximum-Likelihood Bounds for Reed-Solomon Codes over Partial Response Channels
Abstract—Computing maximum-likelihood bounds on the performance of systems involving partial response (PR) channels, with or without an error correcting code present, is rather c...
Richard M. Todd, J. R. Cruz
ATAL
2005
Springer
14 years 4 months ago
An integrated token-based algorithm for scalable coordination
Efficient coordination among large numbers of heterogeneous agents promises to revolutionize the way in which some complex tasks, such as responding to urban disasters can be perf...
Yang Xu, Paul Scerri, Bin Yu, Steven Okamoto, Mich...
STACS
2007
Springer
14 years 4 months ago
Testing Convexity Properties of Tree Colorings
A coloring of a graph is convex if it induces a partition of the vertices into connected subgraphs. Besides being an interesting property from a theoretical point of view, tests f...
Eldar Fischer, Orly Yahalom
ECAI
2006
Springer
14 years 2 months ago
Learning Behaviors Models for Robot Execution Control
Robust execution of robotic tasks is a difficult problem. In many situations, these tasks involve complex behaviors combining different functionalities (e.g. perception, localizat...
Guillaume Infantes, Félix Ingrand, Malik Gh...
NN
2006
Springer
127views Neural Networks» more  NN 2006»
13 years 10 months ago
The asymptotic equipartition property in reinforcement learning and its relation to return maximization
We discuss an important property called the asymptotic equipartition property on empirical sequences in reinforcement learning. This states that the typical set of empirical seque...
Kazunori Iwata, Kazushi Ikeda, Hideaki Sakai