500 search results - page 70 / 100 » A parallel quadratic programming method for dynamic optimiza... |
113
click to vote
ICCV
2009
IEEE
14 years 9 months ago
2009
IEEE
This paper examines the problem of moving object detection. More precisely, it addresses the difficult scenarios where background scene textures in the video might change over tim...
CPAIOR
2006
Springer
15 years 2 months ago
2006
Springer
Temporal planning (TP) is notoriously difficult because it requires to solve a propositional STRIPS planning problem with temporal constraints. In this paper, we propose an efficie...
IPL
2010
14 years 9 months ago
2010
An alphabetic binary tree formulation applies to problems in which an outcome needs to be determined via alphabetically ordered search prior to the termination of some window of o...
99
Voted
CPAIOR
2008
Springer
15 years 28 days ago
2008
Springer
The one-step anticipatory algorithm (1s-AA) is an online algorithm making decisions under uncertainty by ignoring future non-anticipativity constraints. It makes near-optimal decis...
101
click to vote
LCTRTS
2009
Springer
15 years 5 months ago
2009
Springer
The StreamIt programming model has been proposed to exploit parallelism in streaming applications on general purpose multicore architectures. The StreamIt graphs describe task, da...