Sciweavers

6315 search results - page 244 / 1263
» Approximating Solution Structure
Sort
View
CP
2005
Springer
16 years 4 days ago
Using Constraint Programming for Solving Distance CSP with Uncertainty
Many problems in chemistry, robotics or molecular biology can be expressed as a Distance CSP4 . In this paper, we propose a specific methodology for tackling uncertainties in this...
Carlos Grandón, Bertrand Neveu
CORR
2010
Springer
100views Education» more  CORR 2010»
15 years 6 months ago
Convex Relaxations for Subset Selection
We use convex relaxation techniques to produce lower bounds on the optimal value of subset selection problems and generate good approximate solutions. We then explicitly bound the...
Francis Bach, Selin Damla Ahipasaoglu, Alexandre d...
MOC
2002
83views more  MOC 2002»
15 years 6 months ago
A posteriori error estimates for general numerical methods for Hamilton-Jacobi equations. Part I: The steady state case
A new upper bound is provided for the L-norm of the difference between the viscosity solution of a model steady state Hamilton-Jacobi equation, u, and any given approximation, v. T...
Samuel Albert, Bernardo Cockburn, Donald A. French...
VTC
2008
IEEE
125views Communications» more  VTC 2008»
16 years 1 months ago
A General Formula for Log-MGF Computation: Application to the Approximation of Log-Normal Power Sum via Pearson Type IV Distribu
Abstract— In [1], we have recently proposed a general approach for approximating the power sum of Log–Normal Random Variables (RVs) by using the Pearson system of distributions...
Marco Di Renzo, Fabio Graziosi, Fortunato Santucci
ATAL
2008
Springer
15 years 8 months ago
Adaptive Kanerva-based function approximation for multi-agent systems
In this paper, we show how adaptive prototype optimization can be used to improve the performance of function approximation based on Kanerva Coding when solving largescale instanc...
Cheng Wu, Waleed Meleis