Sciweavers

1424 search results - page 25 / 285
» Improving on Version Stamps
Sort
View
85
Voted
GECCO
2006
Springer
196views Optimization» more  GECCO 2006»
15 years 2 months ago
An anticipatory approach to improve XCSF
XCSF is a novel version of learning classifier systems (LCS) which extends the typical concept of LCS by introducing computable classifier prediction. In XCSF Classifier predictio...
Amin Nikanjam, Adel Torkaman Rahmani
82
Voted
FCT
1991
Springer
15 years 2 months ago
Lattice Basis Reduction: Improved Practical Algorithms and Solving Subset Sum Problems
We report on improved practical algorithms for lattice basis reduction. We propose a practical oating point version of the L3{algorithm of Lenstra, Lenstra, Lovasz (1982). We pres...
Claus-Peter Schnorr, M. Euchner
82
Voted
EVOW
2008
Springer
15 years 21 days ago
Multiobjective Prototype Optimization with Evolved Improvement Steps
Recently, a new iterative optimization framework utilizing an evolutionary algorithm called "Prototype Optimization with Evolved iMprovement Steps" (POEMS) was introduced...
Jirí Kubalík, Richard Mordinyi, Stef...
UAI
2004
15 years 9 days ago
MOB-ESP and other Improvements in Probability Estimation
A key prerequisite to optimal reasoning under uncertainty in intelligent systems is to start with good class probability estimates. This paper improves on the current best probabi...
Rodney Nielsen
108
Voted
SODA
2000
ACM
85views Algorithms» more  SODA 2000»
15 years 8 days ago
Improved bounds on the sample complexity of learning
We present a new general upper bound on the number of examples required to estimate all of the expectations of a set of random variables uniformly well. The quality of the estimat...
Yi Li, Philip M. Long, Aravind Srinivasan