Sciweavers

361 search results - page 26 / 73
» Approximate counting by dynamic programming
Sort
View
ASAP
2004
IEEE
185views Hardware» more  ASAP 2004»
13 years 11 months ago
Families of FPGA-Based Algorithms for Approximate String Matching
Dynamic programming for approximate string matching is a large family of different algorithms, which vary significantly in purpose, complexity, and hardware utilization. Many impl...
Tom Van Court, Martin C. Herbordt
LCTRTS
2010
Springer
14 years 2 months ago
Analysis and approximation for bank selection instruction minimization on partitioned memory architecture
A large number of embedded systems include 8-bit microcontrollers for their energy efficiency and low cost. Multi-bank memory architecture is commonly applied in 8-bit microcontr...
Minming Li, Chun Jason Xue, Tiantian Liu, Yingchao...
IJCNN
2006
IEEE
14 years 1 months ago
Cellular SRN Trained by Extended Kalman Filter Shows Promise for ADP
— Cellular simultaneous recurrent neural network has been suggested to be a function approximator more powerful than the MLP’s, in particular for solving approximate dynamic pr...
Roman Ilin, Robert Kozma, Paul J. Werbos
JCC
2011
87views more  JCC 2011»
13 years 2 months ago
Determining equilibrium constants for dimerization reactions from molecular dynamics simulations
Abstract: With today’s available computer power, free energy calculations from equilibrium molecular dynamics simulations “via counting” become feasible for an increasing num...
Djurre H. De Jong, Lars V. Schäfer, Alex H. D...
TROB
2010
129views more  TROB 2010»
13 years 5 months ago
A Probabilistic Particle-Control Approximation of Chance-Constrained Stochastic Predictive Control
—Robotic systems need to be able to plan control actions that are robust to the inherent uncertainty in the real world. This uncertainty arises due to uncertain state estimation,...
Lars Blackmore, Masahiro Ono, Askar Bektassov, Bri...