Sciweavers

922 search results - page 159 / 185
» A generalization of the Lin-Zhao theorem
Sort
View
GECCO
2008
Springer
130views Optimization» more  GECCO 2008»
13 years 8 months ago
Parsimony pressure made easy
The parsimony pressure method is perhaps the simplest and most frequently used method to control bloat in genetic programming. In this paper we first reconsider the size evolutio...
Riccardo Poli, Nicholas Freitag McPhee
GECCO
2008
Springer
179views Optimization» more  GECCO 2008»
13 years 8 months ago
A hybrid method for tuning neural network for time series forecasting
This paper presents an study about a new Hybrid method GRASPES - for time series prediction, inspired in F. Takens theorem and based on a multi-start metaheuristic for combinatori...
Aranildo Rodrigues Lima Junior, Tiago Alessandro E...
ICFP
2010
ACM
13 years 8 months ago
A fresh look at programming with names and binders
A wide range of computer programs, including compilers and theorem provers, manipulate data structures that involve names and binding. However, the design of programming idioms wh...
Nicolas Pouillard, François Pottier
CORR
2008
Springer
93views Education» more  CORR 2008»
13 years 7 months ago
Succinctness of the Complement and Intersection of Regular Expressions
Abstract. We study the succinctness of the complement and intersection of regular expressions. In particular, we show that when constructing a regular expression defining the compl...
Wouter Gelade, Frank Neven
CORR
2010
Springer
188views Education» more  CORR 2010»
13 years 7 months ago
A unified framework for high-dimensional analysis of $M$-estimators with decomposable regularizers
High-dimensional statistical inference deals with models in which the the number of parameters p is comparable to or larger than the sample size n. Since it is usually impossible ...
Sahand Negahban, Pradeep Ravikumar, Martin J. Wain...