500 search results - page 87 / 100 » A parallel quadratic programming method for dynamic optimiza... |
BMCBI
2005
14 years 11 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. ...
SAC
2003
ACM
15 years 4 months ago
2003
ACM
Traditional design and implementation of large atmospheric models is a difficult, tedious and error prone task. With the CTADEL project we investigate a new method of code genera...
ICCV
2003
IEEE
16 years 1 months ago
2003
IEEE
We propose a principled account on multiclass spectral clustering. Given a discrete clustering formulation, we first solve a relaxed continuous optimization problem by eigendecomp...
INFOCOM
2006
IEEE
15 years 5 months ago
2006
IEEE
— Service Composition is a promising technology for providing on-demand services in dynamic and loosely coupled peerto-peer (P2P) networks. Because of system dynamics, such as th...
117
click to vote
ATAL
2005
Springer
15 years 4 months ago
2005
Springer
Reinforcement learning problems are commonly tackled with temporal difference methods, which use dynamic programming and statistical sampling to estimate the long-term value of ta...