Sciweavers

874 search results - page 93 / 175
» Faster Algorithms for Semi-Matching Problems
Sort
View
DAC
2002
ACM
15 years 11 months ago
Combining strengths of circuit-based and CNF-based algorithms for a high-performance SAT solver
We propose Satisfiability Checking (SAT) techniques that lead to a consistent performance improvement of up to 3x over state-ofthe-art SAT solvers like Chaff on important problem ...
Malay K. Ganai, Pranav Ashar, Aarti Gupta, Lintao ...
KDD
2008
ACM
181views Data Mining» more  KDD 2008»
15 years 10 months ago
Fastanova: an efficient algorithm for genome-wide association study
Studying the association between quantitative phenotype (such as height or weight) and single nucleotide polymorphisms (SNPs) is an important problem in biology. To understand und...
Xiang Zhang, Fei Zou, Wei Wang 0010
CVIU
2011
14 years 1 months ago
Graph-based quadratic optimization: A fast evolutionary approach
Quadratic optimization lies at the very heart of many structural pattern recognition and computer vision problems, such as graph matching, object recognition, image segmentation, ...
Samuel Rota Bulò, Marcello Pelillo, Immanue...
STACS
1999
Springer
15 years 2 months ago
A Complete and Tight Average-Case Analysis of Learning Monomials
Abstract. We advocate to analyze the average complexity of learning problems. An appropriate framework for this purpose is introduced. Based on it we consider the problem of learni...
Rüdiger Reischuk, Thomas Zeugmann
GECCO
2007
Springer
192views Optimization» more  GECCO 2007»
15 years 1 months ago
A new crossover technique for Cartesian genetic programming
Genetic Programming was first introduced by Koza using tree representation together with a crossover technique in which random sub-branches of the parents' trees are swapped ...
Janet Clegg, James Alfred Walker, Julian Francis M...