Sciweavers

1242 search results - page 150 / 249
» A Computational Complexity Theory in Membrane Computing
Sort
View
IPM
2000
142views more  IPM 2000»
14 years 9 months ago
Adapting a diagnostic problem-solving model to information retrieval
In this paper, a competition-based connectionist model for diagnostic problem-solving is adapted to information retrieval. In this model, we treat documents as \disorders" an...
Inien Syu, Sheau-Dong Lang
ICRA
2010
IEEE
145views Robotics» more  ICRA 2010»
14 years 8 months ago
Reinforcement learning of motor skills in high dimensions: A path integral approach
— Reinforcement learning (RL) is one of the most general approaches to learning control. Its applicability to complex motor systems, however, has been largely impossible so far d...
Evangelos Theodorou, Jonas Buchli, Stefan Schaal
SAGT
2010
Springer
175views Game Theory» more  SAGT 2010»
14 years 8 months ago
On Learning Algorithms for Nash Equilibria
Can learning algorithms find a Nash equilibrium? This is a natural question for several reasons. Learning algorithms resemble the behavior of players in many naturally arising gam...
Constantinos Daskalakis, Rafael Frongillo, Christo...
PODS
2008
ACM
211views Database» more  PODS 2008»
15 years 10 months ago
The power of two min-hashes for similarity search among hierarchical data objects
In this study we propose sketching algorithms for computing similarities between hierarchical data. Specifically, we look at data objects that are represented using leaf-labeled t...
Sreenivas Gollapudi, Rina Panigrahy
ISSAC
2007
Springer
177views Mathematics» more  ISSAC 2007»
15 years 4 months ago
Component-level parallelization of triangular decompositions
We discuss the parallelization of algorithms for solving polynomial systems symbolically by way of triangular decompositions. We introduce a component-level parallelism for which ...
Marc Moreno Maza, Yuzhen Xie