Sciweavers

876 search results - page 54 / 176
» New Results for the Martin Polynomial
Sort
View
APPROX
2010
Springer
148views Algorithms» more  APPROX 2010»
13 years 10 months ago
Learning and Lower Bounds for AC0 with Threshold Gates
In 2002 Jackson et al. [JKS02] asked whether AC0 circuits augmented with a threshold gate at the output can be efficiently learned from uniform random examples. We answer this ques...
Parikshit Gopalan, Rocco A. Servedio
AAAI
2010
13 years 10 months ago
Propagating Conjunctions of AllDifferent Constraints
We study propagation algorithms for the conjunction of two ALLDIFFERENT constraints. Solutions of an ALLDIFFERENT constraint can be seen as perfect matchings on the variable/value...
Christian Bessiere, George Katsirelos, Nina Narody...
CORR
2010
Springer
114views Education» more  CORR 2010»
13 years 6 months ago
On the Impact of Mutation-Selection Balance on the Runtime of Evolutionary Algorithms
The interplay between the mutation operator and the selection mechanism plays a fundamental role in the behaviour of evolutionary algorithms (EAs). However, this interplay is stil...
Per Kristian Lehre, Xin Yao
IACR
2011
141views more  IACR 2011»
12 years 8 months ago
Approximate common divisors via lattices
We analyze the multivariate generalization of Howgrave-Graham’s algorithm for the approximate common divisor problem. In the m-variable case with modulus N and approximate common...
Henry Cohn, Nadia Heninger
EWCBR
2004
Springer
14 years 2 months ago
Explanation Service for Complex CBR Applications
Case-based Reasoning (CBR) is a mature technology for building knowledge-based systems that are capable to produce useful results even if no answer matches the query exactly. Often...
Rainer Maximini, Andrea Freßmann, Martin Sch...