8728 search results - page 25 / 1746 » On Reduct Construction Algorithms |
COCO
2009
Springer
14 years 3 months ago
2009
Springer
Starting with Kilian (STOC ‘92), several works have shown how to use probabilistically checkable proofs (PCPs) and cryptographic primitives such as collision-resistant hashing to...
FOSSACS
2007
Springer
14 years 3 months ago
2007
Springer
Abstract. System L is a linear λ-calculus with numbers and an iterator, which, although imposing linearity restrictions on terms, has all the computational power of G¨odel’s Sy...
GECCO
2003
Springer
14 years 2 months ago
2003
Springer
A bit climber using a Gray encoding is guaranteed to converge to a global optimum in fewer than ¢¤£¦¥¨§© evaluations on unimodal 1-D functions and on multi-dimensional sph...
ICCBR
2007
Springer
14 years 21 days ago
2007
Springer
The performance of a Case-Based Reasoning system relies on the integrity of its case base but in real life applications the available data used to construct the case base invariabl...
FOCS
1990
IEEE
14 years 26 days ago
1990
IEEE
The lattice reduction algorithm of Gauss is shown to have an average case complexity which is asymptotic to a constant.