Sciweavers

131 search results - page 14 / 27
» Solution Enumeration for Projected Boolean Search Problems
Sort
View
CPAIOR
2010
Springer
13 years 4 months ago
Lazy Clause Generation: Combining the Power of SAT and CP (and MIP?) Solving
Finite domain propagation solving, the basis of constraint programming (CP) solvers, allows building very high-level models of problems, and using highly specific inference encapsu...
Peter J. Stuckey
GECCO
2008
Springer
131views Optimization» more  GECCO 2008»
13 years 7 months ago
Rigorous analyses of fitness-proportional selection for optimizing linear functions
Rigorous runtime analyses of evolutionary algorithms (EAs) mainly investigate algorithms that use elitist selection methods. Two algorithms commonly studied are Randomized Local S...
Edda Happ, Daniel Johannsen, Christian Klein, Fran...
DLOG
2006
13 years 8 months ago
Finding Subsumers for Natural Language Presentation
This work is motivated by the task of describing in natural language a concept defined in an OWL DL ontology. However, rather than focussing on linguistic issues, we address the q...
Chris Mellish, Jeff Z. Pan
SIGMOD
2011
ACM
269views Database» more  SIGMOD 2011»
12 years 9 months ago
Advancing data clustering via projective clustering ensembles
Projective Clustering Ensembles (PCE) are a very recent advance in data clustering research which combines the two powerful tools of clustering ensembles and projective clustering...
Francesco Gullo, Carlotta Domeniconi, Andrea Tagar...
GECCO
2005
Springer
132views Optimization» more  GECCO 2005»
14 years 7 days ago
Evolutionary testing of state-based programs
The application of Evolutionary Algorithms to structural test data generation, known as Evolutionary Testing, has to date largely focused on programs with input-output behavior. H...
Phil McMinn, Mike Holcombe