Sciweavers

2899 search results - page 35 / 580
» On the Complexity of Exclusion Algorithms for Optimization
Sort
View
GECCO
2005
Springer
158views Optimization» more  GECCO 2005»
15 years 6 months ago
Constructive induction and genetic algorithms for learning concepts with complex interaction
Constructive Induction is the process of transforming the original representation of hard concepts with complex interaction into a representation that highlights regularities. Mos...
Leila Shila Shafti, Eduardo Pérez
ICPR
2000
IEEE
16 years 2 months ago
Reduction of Bias in Maximum Likelihood Ellipse Fitting
An improved maximum likelihood estimator for ellipse fitting based on the heteroscedastic errors-in-variables (HEIV) regression algorithm is proposed. The technique significantly ...
Bogdan Matei, Peter Meer
ICTAI
2007
IEEE
15 years 7 months ago
Towards Rare Itemset Mining
We describe here a general approach for rare itemset mining. While mining literature has been almost exclusively focused on frequent itemsets, in many practical situations rare on...
Laszlo Szathmary, Amedeo Napoli, Petko Valtchev
ATAL
2007
Springer
15 years 7 months ago
Reinforcement learning in extensive form games with incomplete information: the bargaining case study
We consider the problem of finding optimal strategies in infinite extensive form games with incomplete information that are repeatedly played. This problem is still open in lite...
Alessandro Lazaric, Jose Enrique Munoz de Cote, Ni...
IPPS
1999
IEEE
15 years 5 months ago
Reducing I/O Complexity by Simulating Coarse Grained Parallel Algorithms
Block-wise access to data is a central theme in the design of efficient external memory (EM) algorithms. A second important issue, when more than one disk is present, is fully par...
Frank K. H. A. Dehne, David A. Hutchinson, Anil Ma...