Sciweavers

648 search results - page 73 / 130
» Simple Algorithms for a Weighted Interval Selection Problem
Sort
View
APPROX
2009
Springer
99views Algorithms» more  APPROX 2009»
14 years 2 months ago
Resource Minimization Job Scheduling
Abstract. Given a set J of jobs, where each job j is associated with release date rj, deadline dj and processing time pj, our goal is to schedule all jobs using the minimum possibl...
Julia Chuzhoy, Paolo Codenotti
TPDS
2010
126views more  TPDS 2010»
13 years 2 months ago
Stabilizing Distributed R-Trees for Peer-to-Peer Content Routing
Publish/subscribe systems provide useful platforms for delivering data (events) from publishers to subscribers in a decoupled fashion. Developing efficient publish/subscribe scheme...
Silvia Bianchi, Pascal Felber, Maria Gradinariu Po...
ICML
2007
IEEE
14 years 8 months ago
On the role of tracking in stationary environments
It is often thought that learning algorithms that track the best solution, as opposed to converging to it, are important only on nonstationary problems. We present three results s...
Richard S. Sutton, Anna Koop, David Silver
EVOW
2009
Springer
14 years 2 months ago
Diversity Control and Multi-Parent Recombination for Evolutionary Graph Coloring Algorithms
We present a hybrid evolutionary algorithm for the graph coloring problem (Evocol). Evocol is based on two simple-but-effective ideas. First, we use an enhanced crossover that col...
Daniel Cosmin Porumbel, Jin-Kao Hao, Pascale Kuntz
COLT
2010
Springer
13 years 5 months ago
Active Learning on Trees and Graphs
We investigate the problem of active learning on a given tree whose nodes are assigned binary labels in an adversarial way. Inspired by recent results by Guillory and Bilmes, we c...
Nicolò Cesa-Bianchi, Claudio Gentile, Fabio...