Sciweavers

171 search results - page 14 / 35
» Searching for a Solution to Program Verification=Equation So...
Sort
View
GECCO
2007
Springer
177views Optimization» more  GECCO 2007»
14 years 1 months ago
Evolving problem heuristics with on-line ACGP
Genetic Programming uses trees to represent chromosomes. The user defines the representation space by defining the set of functions and terminals to label the nodes in the trees. ...
Cezary Z. Janikow
CP
2004
Springer
14 years 1 months ago
Streamlined Constraint Reasoning
Abstract. We introduce a new approach for focusing constraint reasoning using so-called streamlining constraints. Such constraints partition the solution space to drive the search ...
Carla P. Gomes, Meinolf Sellmann
ICASSP
2009
IEEE
14 years 2 months ago
Fast LCD motion deblurring by decimation and optimization
The LCD deblurring problem is considered as a simple bounded quadratic programming problem and is solved using conjugate gradient with early stopping criteria to avoid excessive s...
Stanley H. Chan, Truong Q. Nguyen
PPDP
2010
Springer
13 years 6 months ago
A declarative approach to robust weighted Max-SAT
The presence of uncertainty in the real world makes robustness to be a desired property of solutions to constraint satisfaction problems. Roughly speaking, a solution is robust if...
Miquel Bofill, Dídac Busquets, Mateu Villar...
JMLR
2006
145views more  JMLR 2006»
13 years 7 months ago
Ensemble Pruning Via Semi-definite Programming
An ensemble is a group of learning models that jointly solve a problem. However, the ensembles generated by existing techniques are sometimes unnecessarily large, which can lead t...
Yi Zhang 0006, Samuel Burer, W. Nick Street