251 search results - page 6 / 51 » On Modular Decomposition of Integers |
ROBOCUP
2005
Springer
14 years 27 days ago
2005
Springer
One of the most formidable issues of RL application to real robot tasks is how to find a suitable state space, and this has been much more serious since recent robots tends to hav...
WG
1995
Springer
13 years 11 months ago
1995
Springer
We propose an O(n4) algorithm to build the modular decomposition tree of hypergraphs of dimension 3 and show how this algorithm can be generalized to compute in O(n3k−5) time th...
ESA
2005
Springer
14 years 28 days ago
2005
Springer
We introduce a new way to compute common intervals of K permutations based on a very simple and general notion of generators of common intervals. This formalism leads to simple an...
CEC
2005
IEEE
13 years 9 months ago
2005
IEEE
Abstract- Decomposing a complex computational problem into sub-problems, which are computationally simpler to solve individually and which can be combined to produce a solution to ...
ICML
1994
IEEE
13 years 11 months ago
1994
IEEE
Compositional Q-Learning (CQ-L) (Singh 1992) is a modular approach to learning to performcomposite tasks made up of several elemental tasks by reinforcement learning. Skills acqui...