Sciweavers

3088 search results - page 299 / 618
» Online Passive-Aggressive Algorithms
Sort
View
RTAS
2008
IEEE
16 years 1 months ago
Equivalence between Schedule Representations: Theory and Applications
Multiprocessor scheduling problems are hard because of the numerous constraints on valid schedules to take into account. This paper presents new schedule representations in order ...
Matthieu Lemerre, Vincent David, Christophe Aussag...
HIS
2008
15 years 8 months ago
New Crossover Operator for Evolutionary Rule Discovery in XCS
XCS is a learning classifier system that combines a reinforcement learning scheme with evolutionary algorithms to evolve rule sets on-line by means of the interaction with an envi...
Sergio Morales-Ortigosa, Albert Orriols-Puig, Este...
RECSYS
2010
ACM
15 years 6 months ago
Incremental collaborative filtering via evolutionary co-clustering
Collaborative filtering is a popular approach for building recommender systems. Current collaborative filtering algorithms are accurate but also computationally expensive, and so ...
Mohammad Khoshneshin, W. Nick Street
IPL
2008
80views more  IPL 2008»
15 years 6 months ago
A simpler competitive analysis for scheduling equal-length jobs on one machine with restarts
We consider the online problem of scheduling jobs with equal processing times on a single machine. Each job has a release time and a deadline, and the goal is to maximize the numb...
Michael H. Goldwasser, Arundhati Bagchi Misra
CORR
2011
Springer
169views Education» more  CORR 2011»
15 years 1 months ago
Upper Bounds for Maximally Greedy Binary Search Trees
At SODA 2009, Demaine et al. presented a novel connection between binary search trees (BSTs) and subsets of points on the plane. This connection was independently discovered by Der...
Kyle Fox