Sciweavers

383 search results - page 57 / 77
» A Bound on the Total Chromatic Number
Sort
View
ESCAPE
2007
Springer
228views Algorithms» more  ESCAPE 2007»
14 years 1 months ago
Online Capacitated Interval Coloring
Abstract. In the online capacitated interval coloring problem, a sequence of requests arrive online. Each of the requests is an interval Ij ⊆ {1, 2, . . . , n} with bandwidth bj....
Leah Epstein, Thomas Erlebach, Asaf Levin
FMCAD
2007
Springer
14 years 1 months ago
Exploiting Resolution Proofs to Speed Up LTL Vacuity Detection for BMC
—When model-checking reports that a property holds on a model, vacuity detection increases user confidence in this result by checking that the property is satisfied in the inte...
Jocelyn Simmonds, Jessica Davies, Arie Gurfinkel, ...
ISESE
2006
IEEE
14 years 1 months ago
Empirical estimates of software availability of deployed systems
We consider empirical evaluation of the availability of the deployed software. Evaluation of real systems is more realistic, more accurate, and provides higher level of confidenc...
Audris Mockus
ICTCS
2003
Springer
14 years 26 days ago
Cost Constrained Fixed Job Scheduling
In this paper, we study the problem of cost constrained fixed job scheduling (CCFJS). In this problem, there are a number of processors, each of which belongs to one of several cla...
Qiwei Huang, Errol L. Lloyd
ESA
2001
Springer
105views Algorithms» more  ESA 2001»
14 years 5 days ago
On the Parameterized Complexity of Layered Graph Drawing
We consider graph drawings in which vertices are assigned to layers and edges are drawn as straight line-segments between vertices on adjacent layers. We prove that graphs admittin...
Vida Dujmovic, Michael R. Fellows, Michael T. Hall...