Sciweavers

881 search results - page 73 / 177
» Solving satisfiability problems with preferences
Sort
View
SIAMIS
2010
155views more  SIAMIS 2010»
13 years 3 months ago
Smoothing Nonlinear Conjugate Gradient Method for Image Restoration Using Nonsmooth Nonconvex Minimization
Image restoration problems are often converted into large-scale, nonsmooth and nonconvex optimization problems. Most existing minimization methods are not efficient for solving su...
Xiaojun Chen, Weijun Zhou
GECCO
2007
Springer
300views Optimization» more  GECCO 2007»
14 years 2 months ago
Methodology to select solutions from the pareto-optimal set: a comparative study
The resolution of a Multi-Objective Optimization Problem (MOOP) does not end when the Pareto-optimal set is found. In real problems, a single solution must be selected. Ideally, t...
José C. Ferreira, Carlos M. Fonseca, Ant&oa...
EDBT
2006
ACM
120views Database» more  EDBT 2006»
14 years 9 months ago
Query Planning in the Presence of Overlapping Sources
Navigational queries on Web-accessible life science sources pose unique query optimization challenges. The objects in these sources are interconnected to objects in other sources, ...
Jens Bleiholder, Samir Khuller, Felix Naumann, Lou...
GECCO
2007
Springer
209views Optimization» more  GECCO 2007»
14 years 2 months ago
An online implementable differential evolution tuned optimal guidance law
This paper proposes a novel application of differential evolution to solve a difficult dynamic optimisation or optimal control problem. The miss distance in a missile-target engag...
Raghunathan Thangavelu, S. Pradeep
ECAI
2004
Springer
14 years 15 days ago
Encoding Quantified CSPs as Quantified Boolean Formulae
Quantified Constraint Satisfaction Problems (QCSPs) are CSPs in which some variables are universally quantified. For each possible value of such variables, we have to find ways to ...
Ian P. Gent, Peter Nightingale, Andrew G. D. Rowle...