Sciweavers

435 search results - page 4 / 87
» Deriving Filtering Algorithms from Constraint Checkers
Sort
View
ILP
2005
Springer
14 years 25 days ago
Deriving a Stationary Dynamic Bayesian Network from a Logic Program with Recursive Loops
Recursive loops in a logic program present a challenging problem to the PLP framework. On the one hand, they loop forever so that the PLP backward-chaining inferences would never s...
Yi-Dong Shen, Qiang Yang
ISBI
2008
IEEE
14 years 8 months ago
Tomographic image reconstruction from limited-view projections with Wiener filtered focuss algorithm
In tomographic image reconstruction from limited-view projections the underlying inverse problem is ill-posed with the rank-deficient system matrix. The minimal-norm least squares...
Rafal Zdunek, Zhaoshui He, Andrzej Cichocki
TSP
2008
144views more  TSP 2008»
13 years 7 months ago
A New Robust Variable Step-Size NLMS Algorithm
A new framework for designing robust adaptive filters is introduced. It is based on the optimization of a certain cost function subject to a time-dependent constraint on the norm o...
Leonardo Rey Vega, Hernan Rey, Jacob Benesty, Sara...
AAAI
2007
13 years 9 months ago
Synthesis of Constraint-Based Local Search Algorithms from High-Level Models
The gap in automation between MIP/SAT solvers and those for constraint programming and constraint-based local search hinders experimentation and adoption of these technologies and...
Pascal Van Hentenryck, Laurent D. Michel
AI
2008
Springer
13 years 7 months ago
Domain filtering consistencies for non-binary constraints
In non-binary constraint satisfaction problems, the study of local consistencies that only prune values from domains has so far been largely limited to generalized arc consistency...
Christian Bessiere, Kostas Stergiou, Toby Walsh