Sciweavers

1725 search results - page 308 / 345
» Relaxed genetic programming
Sort
View
ICANN
2007
Springer
15 years 3 months ago
Selection of Decision Stumps in Bagging Ensembles
Abstract. This article presents a comprehensive study of different ensemble pruning techniques applied to a bagging ensemble composed of decision stumps. Six different ensemble p...
Gonzalo Martínez-Muñoz, Daniel Hern&...
ICANNGA
2007
Springer
153views Algorithms» more  ICANNGA 2007»
15 years 3 months ago
Automatic Design of ANNs by Means of GP for Data Mining Tasks: Iris Flower Classification Problem
This paper describes a new technique for automatically developing Artificial Neural Networks (ANNs) by means of an Evolutionary Computation (EC) tool, called Genetic Programming (G...
Daniel Rivero, Juan R. Rabuñal, Julian Dora...
IWCLS
2007
Springer
15 years 3 months ago
On Lookahead and Latent Learning in Simple LCS
Learning Classifier Systems use evolutionary algorithms to facilitate rule- discovery, where rule fitness is traditionally payoff based and assigned under a sharing scheme. Most c...
Larry Bull
IAT
2006
IEEE
15 years 3 months ago
An Approximate Algorithm for Resource Allocation Using Combinatorial Auctions
Combinatorial Auctions (CAs), where users bid on combination of items, have emerged as a useful tool for resource allocation in distributed systems. However, two main difficulties...
Viswanath Avasarala, Himanshu Polavarapu, Tracy Mu...
ISCAS
2006
IEEE
112views Hardware» more  ISCAS 2006»
15 years 3 months ago
Towards an optimised VLSI design algorithm for the constant matrix multiplication problem
The efficient design of multiplierless implementa- The goal is to find the optimal sub-expressions across all N dot tions of constant matrix multipliers is challenged by the huge p...
Andrew Kinane, Valentin Muresan, Noel E. O'Connor