Sciweavers

6456 search results - page 431 / 1292
» Constraint Solving on Terms
Sort
View
OL
2011
177views Neural Networks» more  OL 2011»
14 years 9 months ago
Exploiting vector space properties to strengthen the relaxation of bilinear programs arising in the global optimization of proce
In this paper we present a methodology for finding tight convex relaxations for a special set of quadratic constraints given by bilinear and linear terms that frequently arise in ...
Juan P. Ruiz, Ignacio E. Grossmann
AAAI
1993
15 years 8 months ago
On the Adequateness of the Connection Method
Roughly speaking, adequatness is the property of a theorem proving method to solve simpler problems faster than more difficult ones. Automated inferencing methods are often not ad...
Antje Beringer, Steffen Hölldobler
IJCAI
1989
15 years 8 months ago
An Approximate Solver for Symbolic Equations
This paper describes a program, called NEWTON, that finds approximate symbolic solutions to parameterized equations in one variable. N E W T O N derives an initial approximation b...
Elisha Sacks
ICIP
2002
IEEE
16 years 8 months ago
Multigrid image reconstruction from arbitrarily spaced samples
We propose a novel multiresolution-multigrid based signal reconstruction method from arbitrarily spaced samples. The signal is reconstructed on a uniform grid using B-splines basi...
Michael Sühling, Michael Unser, Muthuvel Arig...
ICML
2006
IEEE
16 years 7 months ago
Fast direct policy evaluation using multiscale analysis of Markov diffusion processes
Policy evaluation is a critical step in the approximate solution of large Markov decision processes (MDPs), typically requiring O(|S|3 ) to directly solve the Bellman system of |S...
Mauro Maggioni, Sridhar Mahadevan