Sciweavers

8413 search results - page 435 / 1683
» Ordering Problem Subgoals
Sort
View
ASPDAC
2005
ACM
97views Hardware» more  ASPDAC 2005»
15 years 8 months ago
Fast synthesis of exact minimal reversible circuits using group theory
- We present fast algorithms to synthesize exact minimal reversible circuits for various types of gates and costs. By reducing reversible logic synthesis problems to group theory p...
Guowu Yang, Xiaoyu Song, William N. N. Hung, Marek...
CP
2008
Springer
15 years 8 months ago
Classes of Submodular Constraints Expressible by Graph Cuts
Submodular constraints play an important role both in theory and practice of valued constraint satisfaction problems (VCSPs). It has previously been shown, using results from the ...
Stanislav Zivný, Peter Jeavons
ECAI
2008
Springer
15 years 8 months ago
Exploiting locality of interactions using a policy-gradient approach in multiagent learning
In this paper, we propose a policy gradient reinforcement learning algorithm to address transition-independent Dec-POMDPs. This approach aims at implicitly exploiting the locality...
Francisco S. Melo
ICANNGA
2007
Springer
153views Algorithms» more  ICANNGA 2007»
15 years 8 months ago
A Neural Framework for Robot Motor Learning Based on Memory Consolidation
Neural networks are a popular technique for learning the adaptive control of non-linear plants. When applied to the complex control of android robots, however, they suffer from se...
Heni Ben Amor, Shuhei Ikemoto, Takashi Minato, Ber...
AAAI
2010
15 years 8 months ago
Genome Rearrangement: A Planning Approach
Evolutionary trees of species can be reconstructed by pairwise comparison of their entire genomes. Such a comparison can be quantified by determining the number of events that cha...
Tansel Uras, Esra Erdem