453 search results - page 53 / 91 » On Approximation of Bookmark Assignments |
120
click to vote
WAOA
2004
Springer
15 years 6 months ago
2004
Springer
We consider a non-preemptive, stochastic parallel machine scheduling model with the goal to minimize the weighted completion times of jobs. In contrast to the classical stochastic ...
MSR
2010
ACM
15 years 6 months ago
2010
ACM
—The severity of a reported bug is a critical factor in deciding how soon it needs to be fixed. Unfortunately, while clear guidelines exist on how to assign the severity of a bu...
101
click to vote
CDC
2009
IEEE
15 years 6 months ago
2009
IEEE
— Timed Continuous Petri Net (TCPN) systems are piecewise linear models with input constraints that can approximate the dynamical behavior of a class of timed discrete event syst...
112
click to vote
COCOON
1999
Springer
15 years 5 months ago
1999
Springer
Scheduling jobs with pairwise conflicts is modeled by the graph multicoloring problem. It occurs in two versions: in the preemptive case, each vertex may get any set of colors, w...
105
Voted
EVOW
2008
Springer
15 years 3 months ago
2008
Springer
The bi-objective ring star problem aims to locate a cycle through a subset of nodes of a graph while optimizing two types of cost. The first criterion is to minimize a ring cost, r...