Sciweavers

10493 search results - page 1587 / 2099
» Dynamic Word Problems
Sort
View
SIAMSC
2010
215views more  SIAMSC 2010»
15 years 2 months ago
A Fast Algorithm for Sparse Reconstruction Based on Shrinkage, Subspace Optimization, and Continuation
We propose a fast algorithm for solving the ℓ1-regularized minimization problem minx∈Rn µ x 1 + Ax − b 2 2 for recovering sparse solutions to an undetermined system of linea...
Zaiwen Wen, Wotao Yin, Donald Goldfarb, Yin Zhang
SIAMSC
2010
142views more  SIAMSC 2010»
15 years 2 months ago
Nested Iteration and First-Order System Least Squares for Incompressible, Resistive Magnetohydrodynamics
This paper develops a nested iteration algorithm to solve time-dependent nonlinear systems of partial differential equations. For each time step, Newton’s method is used to form...
J. H. Adler, Thomas A. Manteuffel, Stephen F. McCo...
SIAMSC
2010
116views more  SIAMSC 2010»
15 years 2 months ago
Recursively Accelerated Multilevel Aggregation for Markov Chains
A recursive acceleration method is proposed for multiplicative multilevel aggregation algorithms that calculate the stationary probability vector of large, sparse, and irreducible ...
Hans De Sterck, K. Miller, G. Sanders, M. Winlaw
FAST
2009
15 years 2 months ago
Provenance as Data Mining: Combining File System Metadata with Content Analysis
Provenance describes how an object came to be in its present state. Thus, it describes the evolution of the object over time. Prior work on provenance has focussed on databases an...
Vinay Deolalikar, Hernan Laffitte
AI
2011
Springer
14 years 11 months ago
State agnostic planning graphs: deterministic, non-deterministic, and probabilistic planning
Planning graphs have been shown to be a rich source of heuristic information for many kinds of planners. In many cases, planners must compute a planning graph for each element of ...
Daniel Bryce, William Cushing, Subbarao Kambhampat...
« Prev « First page 1587 / 2099 Last » Next »