Sciweavers

2989 search results - page 314 / 598
» Using Domain-Independent Problems for Introducing Formal Met...
Sort
View
CORR
2011
Springer
282views Education» more  CORR 2011»
15 years 1 months ago
Fast Linearized Bregman Iteration for Compressive Sensing and Sparse Denoising
We propose and analyze an extremely fast, efficient and simple method for solving the problem: min{ u 1 :Au=f,u∈Rn }. This method was first described in [1], with more details i...
Stanley Osher, Yu Mao, Bin Dong, Wotao Yin
179
Voted
CDC
2010
IEEE
139views Control Systems» more  CDC 2010»
15 years 1 months ago
Q-learning and enhanced policy iteration in discounted dynamic programming
We consider the classical finite-state discounted Markovian decision problem, and we introduce a new policy iteration-like algorithm for finding the optimal state costs or Q-facto...
Dimitri P. Bertsekas, Huizhen Yu
FMSB
2008
199views Formal Methods» more  FMSB 2008»
15 years 8 months ago
Bounded Asynchrony: Concurrency for Modeling Cell-Cell Interactions
We introduce bounded asynchrony, a notion of concurrency tailored to the modeling of biological cell-cell interactions. Bounded asynchrony is the result of a scheduler that bounds ...
Jasmin Fisher, Thomas A. Henzinger, Maria Mateescu...
ICALP
1997
Springer
15 years 11 months ago
Recursive Computational Depth
In the 1980's, Bennett introduced computational depth as a formal measure of the amount of computational history that is evident in an object's structure. In particular,...
James I. Lathrop, Jack H. Lutz
GIS
2009
ACM
15 years 10 months ago
Dynamic network data exploration through semi-supervised functional embedding
The paper presents a framework for semi-supervised nonlinear embedding methods useful for exploratory analysis and visualization of spatio-temporal network data. The method provid...
Alexei Pozdnoukhov