Sciweavers

6110 search results - page 428 / 1222
» Approximate Computing
Sort
View
ENDM
2010
115views more  ENDM 2010»
15 years 4 months ago
On the knapsack closure of 0-1 Integer Linear Programs
Many inequalities for Mixed-Integer Linear Programs (MILPs) or pure Integer Linear Programs (ILPs) are derived from the Gomory corner relaxation, where all the nonbinding constrai...
Matteo Fischetti, Andrea Lodi
INFORMS
2008
241views more  INFORMS 2008»
15 years 6 months ago
Solving the Capacitated Local Access Network Design Problem
We propose an exact solution method for a routing and capacity installation problem in networks. Given an input graph, the problem is to route traffic from a set of source nodes t...
F. Sibel Salman, R. Ravi, John N. Hooker
ICPR
2000
IEEE
16 years 8 months ago
Estimation of Adaptive Parameters for Satellite Image Deconvolution
The deconvolution of blurred and noisy satellite images is an ill-posed inverse problem, which can be regularized within a Bayesian context by using an a priori model of the recon...
André Jalobeanu, Josiane Zerubia, Laure Bla...
ECAI
2008
Springer
15 years 8 months ago
Reinforcement Learning with the Use of Costly Features
In many practical reinforcement learning problems, the state space is too large to permit an exact representation of the value function, much less the time required to compute it. ...
Robby Goetschalckx, Scott Sanner, Kurt Driessens
CIG
2005
IEEE
16 years 14 days ago
Nannon: A Nano Backgammon for Machine Learning Research
A newly designed game is introduced, which feels like Backgammon, but has a simplified rule set. Unlike earlier attempts at simplifying the game, Nannon maintains enough features a...
Jordan B. Pollack