5314 search results - page 386 / 1063 » Hybrid Dynamic Programming |
211
click to vote
JMLR
2012
13 years 9 months ago
2012
To relax the homogeneity assumption of classical dynamic Bayesian networks (DBNs), various recent studies have combined DBNs with multiple changepoint processes. The underlying as...
176
click to vote
INFOCOM
2010
IEEE
15 years 5 months ago
2010
IEEE
Abstract—The main task in analyzing a switching network design (including circuit-, multirate-, and photonic-switching) is to determine the minimum number of some switching compo...
157
click to vote
HOTSWUP
2009
ACM
15 years 11 months ago
2009
ACM
We consider the state mapping problem for dynamic software updates and propose a number of approaches that have the potential of automating the state mapping in practical setting....
180
click to vote
FOCS
1992
IEEE
15 years 10 months ago
1992
IEEE
We describe dynamic data structures for half-space range reporting and for maintaining the minima of a decomposable function. Using these data structures, we obtain efficient dyna...
159
click to vote
FOAL
2007
ACM
15 years 10 months ago
2007
ACM
By modeling dynamic join points, pointcuts, and advice in a defunctionalized continuation-passing style interpreter, we provide a fundamental account of these AOP mechanisms. Dyna...