Sciweavers

4544 search results - page 560 / 909
» Reinforcement Learning with Time
Sort
View
NIPS
2008
15 years 8 months ago
An Online Algorithm for Maximizing Submodular Functions
We present an algorithm for solving a broad class of online resource allocation . Our online algorithm can be applied in environments where abstract jobs arrive one at a time, and...
Matthew J. Streeter, Daniel Golovin
NECO
2008
114views more  NECO 2008»
15 years 6 months ago
A Sparse Generative Model of V1 Simple Cells with Intrinsic Plasticity
Current models for the learning of feature detectors work on two time scales: on a fast time scale the internal neurons' activations adapt to the current stimulus; on a slow ...
Cornelius Weber, Jochen Triesch
COGSCI
2004
78views more  COGSCI 2004»
15 years 6 months ago
Varieties of sameness: the impact of relational complexity on perceptual comparisons
The fundamental relations that underlie cognitive comparisons--"same" and "different"--can be demultiple levels of abstraction, which vary in relational comple...
James K. Kroger, Keith J. Holyoak, John E. Hummel
CLOUDCOM
2010
Springer
15 years 4 months ago
Bag-of-Tasks Scheduling under Budget Constraints
Commercial cloud offerings, such as Amazon's EC2, let users allocate compute resources on demand, charging based on reserved time intervals. While this gives great flexibilit...
Ana-Maria Oprescu, Thilo Kielmann
ICDM
2009
IEEE
200views Data Mining» more  ICDM 2009»
15 years 4 months ago
Improving SVM Classification on Imbalanced Data Sets in Distance Spaces
Abstract--Imbalanced data sets present a particular challenge to the data mining community. Often, it is the rare event that is of interest and the cost of misclassifying the rare ...
Suzan Koknar-Tezel, Longin Jan Latecki