Sciweavers

9611 search results - page 266 / 1923
» A Note on Difference Sets
Sort
View
GECCO
2009
Springer
124views Optimization» more  GECCO 2009»
15 years 11 months ago
Reinforcement learning for games: failures and successes
We apply CMA-ES, an evolution strategy with covariance matrix adaptation, and TDL (Temporal Difference Learning) to reinforcement learning tasks. In both cases these algorithms se...
Wolfgang Konen, Thomas Bartz-Beielstein
LREC
2010
132views Education» more  LREC 2010»
15 years 8 months ago
Development and Use of an Evaluation Collection for Personalisation of Digital Newspapers
This paper presents the process of development and the characteristics of an evaluation collection for a personalisation system for digital newspapers. This system selects, adapts...
Alberto Díaz, Pablo Gervás, Antonio ...
BIOCOMP
2006
15 years 8 months ago
A Heuristic Approach to Scoring Gene Clustering Algorithms
In the past decades, many clustering algorithms have been proposed for the analysis of gene expression data, but little guidance is available to help choose among them. Given the ...
Longde Yin, Chun-Hsi Huang
PR
2008
88views more  PR 2008»
15 years 6 months ago
Modified global k
Clustering in gene expression data sets is a challenging problem. Different algorithms for clustering of genes have been proposed. However due to the large number of genes only a ...
Adil M. Bagirov
SIAMDM
2010
105views more  SIAMDM 2010»
15 years 1 months ago
The Brunn--Minkowski Inequality and Nontrivial Cycles in the Discrete Torus
Let (Cd m) denote the graph whose set of vertices is Zd m in which two distinct vertices are adjacent iff in each coordinate either they are equal or they differ, modulo m, by at
Noga Alon, Ohad N. Feldheim