Sciweavers

5757 search results - page 1141 / 1152
» Dynamic Policy Programming
Sort
View
MICRO
2006
IEEE
94views Hardware» more  MICRO 2006»
13 years 7 months ago
A Sampling Method Focusing on Practicality
In the past few years, several research works have demonstrated that sampling can drastically speed up architecture simulation, and several of these sampling techniques are already...
Daniel Gracia Pérez, Hugues Berry, Olivier ...
PRL
2008
198views more  PRL 2008»
13 years 7 months ago
Pose estimation and tracking using multivariate regression
This paper presents an extension of the relevance vector machine (RVM) algorithm to multivariate regression. This allows the application to the task of estimating the pose of an a...
Arasanathan Thayananthan, Ramanan Navaratnam, Bj&o...
AAMAS
2005
Springer
13 years 7 months ago
Cooperative Multi-Agent Learning: The State of the Art
Cooperative multi-agent systems are ones in which several agents attempt, through their interaction, to jointly solve tasks or to maximize utility. Due to the interactions among t...
Liviu Panait, Sean Luke
ALGORITHMICA
2005
195views more  ALGORITHMICA 2005»
13 years 7 months ago
Bit-Parallel Witnesses and Their Applications to Approximate String Matching
We present a new bit-parallel technique for approximate string matching. We build on two previous techniques. The first one, BPM [Myers, J. of the ACM, 1999], searches for a patte...
Heikki Hyyrö, Gonzalo Navarro
TCS
2008
13 years 7 months ago
Algorithms for computing variants of the longest common subsequence problem
The longest common subsequence(LCS) problem is one of the classical and wellstudied problems in computer science. The computation of the LCS is a frequent task in DNA sequence ana...
Costas S. Iliopoulos, M. Sohel Rahman
« Prev « First page 1141 / 1152 Last » Next »