Sciweavers

435 search results - page 56 / 87
» Partitioning Search Spaces of a Randomized Search
Sort
View
GECCO
2003
Springer
15 years 3 months ago
Methods for Evolving Robust Programs
Many evolutionary computation search spaces require fitness assessment through the sampling of and generalization over a large set of possible cases as input. Such spaces seem par...
Liviu Panait, Sean Luke
SIGMOD
2000
ACM
141views Database» more  SIGMOD 2000»
15 years 2 months ago
Counting, Enumerating, and Sampling of Execution Plans in a Cost-Based Query Optimizer
Testing an SQL database system by running large sets of deterministic or stochastic SQL statements is common practice in commercial database development. However, code defects oft...
Florian Waas, César A. Galindo-Legaria
AAAI
2008
15 years 2 days ago
A New Incomplete Method for CSP Inconsistency Checking
Checking CSP consistency is shown, in theory, to be an NP-complete problem. There is two families of methods for CSP consistency checking. The first family holds the complete meth...
Belaid Benhamou, Mohamed Réda Saïdi
ICMLA
2007
14 years 11 months ago
Scalable optimal linear representation for face and object recognition
Optimal Component Analysis (OCA) is a linear method for feature extraction and dimension reduction. It has been widely used in many applications such as face and object recognitio...
Yiming Wu, Xiuwen Liu, Washington Mio
ICGI
2010
Springer
14 years 7 months ago
Exact DFA Identification Using SAT Solvers
Abstract. We present an exact algorithm for identification of deterministic finite automata (DFA) which is based on satisfiability (SAT) solvers. Despite the size of the low level ...
Marijn J. H. Heule, Sicco Verwer