Sciweavers

6562 search results - page 114 / 1313
» Noetherianity and Combination Problems
Sort
View
139
Voted
ICIP
2008
IEEE
15 years 11 months ago
An iterative algorithm for linear inverse problems with compound regularizers
In several imaging inverse problems, it may be of interest to encourage the solution to have characteristics which are most naturally expressed by the combination of more than one...
José M. Bioucas-Dias, Mário A. T. Fi...
125
Voted
AIR
2010
96views more  AIR 2010»
15 years 4 months ago
Logic programming for combinatorial problems
Combinatorial problems appear in many areas in science, engineering, biomedicine, business, and operations research. This article presents a new intelligent computing approach for...
Toshinori Munakata, Roman Barták
CSR
2007
Springer
15 years 10 months ago
Equivalence Problems for Circuits over Sets of Natural Numbers
We investigate the complexity of equivalence problems for {∪, ∩, − , +, ×}-circuits computing sets of natural numbers. These problems were first introduced by Stockmeyer an...
Christian Glaßer, Katrin Herr, Christian Rei...
EVOW
2004
Springer
15 years 10 months ago
Scatter Search and Memetic Approaches to the Error Correcting Code Problem
We consider the problem of designing error correcting codes (ECC), a hard combinatorial optimization problem of relevance in the field of telecommunications. This problem is tackl...
Carlos Cotta
UAI
1998
15 years 6 months ago
Flexible Decomposition Algorithms for Weakly Coupled Markov Decision Problems
This paper presents two new approaches to decomposing and solving large Markov decision problems (MDPs), a partial decoupling method and a complete decoupling method. In these app...
Ronald Parr