361 search results - page 54 / 73 » Approximate counting by dynamic programming |
BMCBI
2005
13 years 7 months ago
2005
Background: Exhaustive methods of sequence alignment are accurate but slow, whereas heuristic approaches run quickly, but their complexity makes them more difficult to implement. ...
IROS
2009
IEEE
14 years 2 months ago
2009
IEEE
— This paper presents a standing balance controller. We employ a library of optimal trajectories and the neighboring optimal control method to generate local approximations to th...
CDC
2009
IEEE
14 years 7 days ago
2009
IEEE
— Timed Continuous Petri Net (TCPN) systems are piecewise linear models with input constraints that can approximate the dynamical behavior of a class of timed discrete event syst...
CISS
2007
IEEE
13 years 11 months ago
2007
IEEE
Abstract-Joint subcarrier, power and rate allocation in orthogonal frequency division multiple access (OFDMA) scheduling is investigated for both downlink and uplink wireless trans...
ESA
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. In the present work, we are interested in the practical behavior of a new fptas to solve the approximation version of the 0-1 multiobjective knapsack problem. Nevertheles...