Sciweavers

698 search results - page 80 / 140
» A Deterministic Algorithm for Solving Imprecise Decision Pro...
Sort
View
ICASSP
2011
IEEE
13 years 27 days ago
Median filter with absolute value norm spatial regularization
We provide a novel formulation for computing median filter with spatial regularization as minimizing a cost function composed of absolute value norms. We turn this cost minimizat...
Nilanjan Ray
SIAMSC
2010
215views more  SIAMSC 2010»
13 years 7 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
ICML
2007
IEEE
14 years 10 months ago
Automatic shaping and decomposition of reward functions
This paper investigates the problem of automatically learning how to restructure the reward function of a Markov decision process so as to speed up reinforcement learning. We begi...
Bhaskara Marthi
AICCSA
2001
IEEE
200views Hardware» more  AICCSA 2001»
14 years 24 days ago
Location Management in Mobile Computing
This paper presents a novel approach based on clustering algorithms in combination with the location area (LA) scheme to solve the mobility management problem. Users' movemen...
Riky Subrata, Albert Y. Zomaya
SAGA
2005
Springer
14 years 2 months ago
Two Metaheuristics for Multiobjective Stochastic Combinatorial Optimization
Two general-purpose metaheuristic algorithms for solving multiobjective stochastic combinatorial optimization problems are introduced: SP-ACO (based on the Ant Colony Optimization ...
Walter J. Gutjahr