Sciweavers

1333 search results - page 122 / 267
» Not a Number of Floating Point Problems
Sort
View
ATAL
2010
Springer
15 years 5 months ago
Point-based backup for decentralized POMDPs: complexity and new algorithms
Decentralized POMDPs provide an expressive framework for sequential multi-agent decision making. Despite their high complexity, there has been significant progress in scaling up e...
Akshat Kumar, Shlomo Zilberstein
SIAMSC
2008
198views more  SIAMSC 2008»
15 years 3 months ago
Model Reduction for Large-Scale Systems with High-Dimensional Parametric Input Space
A model-constrained adaptive sampling methodology is proposed for reduction of large-scale systems with high-dimensional parametric input spaces. Our model reduction method uses a ...
T. Bui-Thanh, Karen Willcox, Omar Ghattas
SAT
2004
Springer
106views Hardware» more  SAT 2004»
15 years 9 months ago
Local Search with Bootstrapping
We propose and study a technique to improve the performance of those local-search SAT solvers that proceed by executing a prespecified number of tries, each starting with an eleme...
Lengning Liu, Miroslaw Truszczynski
137
Voted
ICASSP
2010
IEEE
15 years 4 months ago
Iterated smoothing for accelerated gradient convex minimization in signal processing
In this paper, we consider the problem of minimizing a non-smooth convex problem using first-order methods. The number of iterations required to guarantee a certain accuracy for ...
Tobias Lindstrøm Jensen, Jan Østerga...
ENGL
2007
94views more  ENGL 2007»
15 years 3 months ago
Common subproofs in proof pairs
Abstract—In any formal theory, a proof is a sequence of well formed formulas (wff). Here, we consider the digraph whose nodes are proofs and the edges are pairs of proofs such t...
Guillermo Morales-Luna