Sciweavers

86 search results - page 10 / 18
» A New Approach to Estimating the Expected First Hitting Time...
Sort
View
ICML
2009
IEEE
14 years 8 months ago
Robot trajectory optimization using approximate inference
The general stochastic optimal control (SOC) problem in robotics scenarios is often too complex to be solved exactly and in near real time. A classical approximate solution is to ...
Marc Toussaint
BMCBI
2007
233views more  BMCBI 2007»
13 years 7 months ago
160-fold acceleration of the Smith-Waterman algorithm using a field programmable gate array (FPGA)
Background: To infer homology and subsequently gene function, the Smith-Waterman (SW) algorithm is used to find the optimal local alignment between two sequences. When searching s...
Isaac T. S. Li, Warren Shum, Kevin Truong
AIPS
2010
13 years 10 months ago
The Joy of Forgetting: Faster Anytime Search via Restarting
Anytime search algorithms solve optimisation problems by quickly finding a usually suboptimal solution and then finding improved solutions when given additional time. To deliver a...
Silvia Richter, Jordan Tyler Thayer, Wheeler Ruml
TSP
2008
118views more  TSP 2008»
13 years 7 months ago
Analytical Rate-Distortion-Complexity Modeling of Wavelet-Based Video Coders
Analytical modeling of the performance of video coders is essential in a variety of applications, such as power-constrained processing, complexity-driven video streaming, etc., whe...
Brian Foo, Yiannis Andreopoulos, Mihaela van der S...
BMCBI
2010
135views more  BMCBI 2010»
13 years 7 months ago
Efficient genome-scale phylogenetic analysis under the duplication-loss and deep coalescence cost models
Background: Genomic data provide a wealth of new information for phylogenetic analysis. Yet making use of this data requires phylogenetic methods that can efficiently analyze extr...
Mukul S. Bansal, J. Gordon Burleigh, Oliver Eulens...