Sciweavers

10054 search results - page 194 / 2011
» On the Complexity of Function Learning
Sort
View
GECCO
2005
Springer
155views Optimization» more  GECCO 2005»
15 years 6 months ago
A pareto archive evolutionary strategy based radial basis function neural network training algorithm for failure rate prediction
This paper outlines a radial basis function neural network approach to predict the failures in overhead distribution lines of power delivery systems. The RBF networks are trained ...
Grant Cochenour, Jerad Simon, Sanjoy Das, Anil Pah...
94
Voted
ITICSE
1997
ACM
15 years 5 months ago
A genetic algorithms tutorial tool for numerical function optimisation
The field of Genetic Algorithms has grown into a huge area over the last few years. Genetic Algorithms are adaptive methods, which can be used to solve search and optimisation pro...
Edmund K. Burke, D. B. Varley
85
Voted
CORR
2010
Springer
70views Education» more  CORR 2010»
15 years 25 days ago
Structured sparsity-inducing norms through submodular functions
Sparse methods for supervised learning aim at finding good linear predictors from as few variables as possible, i.e., with small cardinality of their supports. This combinatorial ...
Francis Bach
JMLR
2010
187views more  JMLR 2010»
14 years 7 months ago
SFO: A Toolbox for Submodular Function Optimization
In recent years, a fundamental problem structure has emerged as very useful in a variety of machine learning applications: Submodularity is an intuitive diminishing returns proper...
Andreas Krause
109
Voted
IACR
2011
115views more  IACR 2011»
14 years 12 days ago
Pseudorandom Functions and Lattices
We give direct constructions of pseudorandom function (PRF) families based on conjectured hard lattice problems and learning problems. Our constructions are asymptotically effici...
Abhishek Banerjee, Chris Peikert, Alon Rosen