Sciweavers

2041 search results - page 139 / 409
» Balance Machines: Computing = Balancing
Sort
View
COLT
2008
Springer
14 years 12 months ago
Adapting to a Changing Environment: the Brownian Restless Bandits
In the multi-armed bandit (MAB) problem there are k distributions associated with the rewards of playing each of k strategies (slot machine arms). The reward distributions are ini...
Aleksandrs Slivkins, Eli Upfal
GPEM
2008
128views more  GPEM 2008»
14 years 10 months ago
Coevolutionary bid-based genetic programming for problem decomposition in classification
In this work a cooperative, bid-based, model for problem decomposition is proposed with application to discrete action domains such as classification. This represents a significan...
Peter Lichodzijewski, Malcolm I. Heywood
ML
2010
ACM
119views Machine Learning» more  ML 2010»
14 years 8 months ago
A cooperative coevolutionary algorithm for instance selection for instance-based learning
This paper presents a cooperative evolutionary approach for the problem of instance selection for instance based learning. The presented model takes advantage of one of the most r...
Nicolás García-Pedrajas, Juan Antoni...
MIDDLEWARE
2007
Springer
15 years 4 months ago
Fair access to scarce resources in ad-hoc grids using an economic-based approach
In ad-hoc Grids where the availability of resources and tasks changes over the time, distributing the tasks among the scarce resources in a balanced way is a challenging task. In ...
Behnaz Pourebrahimi, Koen Bertels
BMCBI
2008
123views more  BMCBI 2008»
14 years 10 months ago
Statistical methodology for the analysis of dye-switch microarray experiments
Background: In individually dye-balanced microarray designs, each biological sample is hybridized on two different slides, once with Cy3 and once with Cy5. While this strategy ens...
Tristan Mary-Huard, Julie Aubert, Nadera Mansouri-...