SIAMCO
2010
13 years 6 months ago
2010
Abstract. We establish results for the problem of tracking a time-dependent manifold arising in realtime optimization by casting this as a parametric generalized equation. We demon...
JMLR
2010
13 years 6 months ago
2010
Real stochastic processes operating in continuous time can be modeled by sets of stochastic differential equations. On the other hand, several popular model families, including hi...
TVCG
2008
13 years 11 months ago
2008
Abstract-- Fluid simulations typically produce complex threedimensional iso-surfaces whose geometry and topology change over time. The standard way of representing such "dynam...
MCS
2008
Springer
13 years 11 months ago
2008
Springer
A stochastic numerical scheme for an extended immersed boundary method which incorporates thermal fluctuations for the simulation of microscopic biological systems consisting of fl...
CDC
2009
IEEE
14 years 16 days ago
2009
IEEE
In this article, we investigate real-time estimation of flow states, average velocity and stage (water depth), in open channels using the measurements obtained from Lagrangian sens...
APVIS
2009
14 years 17 days ago
2009
The ability to extract and follow time-varying flow features in volume data generated from large-scale numerical simulations enables scientists to effectively see and validate mod...
NIPS
2004
14 years 24 days ago
2004
We consider an MDP setting in which the reward function is allowed to change during each time step of play (possibly in an adversarial manner), yet the dynamics remain fixed. Simi...
AAAI
2006
14 years 25 days ago
2006
Coordinating multiple agents that need to perform a sequence of actions to maximize a system level reward requires solving two distinct credit assignment problems. First, credit m...
SDM
2010
SIAM
14 years 27 days ago
2010
SIAM
This paper addresses the challenging problem of learning from multiple annotators whose labeling accuracy (reliability) differs and varies over time. We propose a framework based ...
DIALM
2005
ACM
14 years 1 months ago
2005
ACM
We investigate to what extent flooding and routing is possible if the graph is allowed to change unpredictably at each time step. We study what minimal requirements are necessary...