278 search results - page 40 / 56 » Two Upper Bounds on the Chromatic Number |
160
click to vote
ISAAC
2007
Springer
16 years 6 days ago
2007
Springer
Abstract. We show how to represent sets in a linear space data structure such that expressions involving unions and intersections of sets can be computed in a worst-case efficient ...
153
click to vote
HIPC
2004
Springer
15 years 11 months ago
2004
Springer
It is well known that in a typical real-time system, certain parameters, such as the execution time of a job, are not fixed numbers. In such systems, it is common to characterize ...
144
click to vote
STACS
2004
Springer
15 years 11 months ago
2004
Springer
We present two simple algorithms for SAT and prove upper bounds on their running time. Given a Boolean formula F in conjunctive normal form, the first algorithm finds a satisfyin...
169
click to vote
ECRTS
1998
IEEE
15 years 10 months ago
1998
IEEE
This paper introduces improvements in partitioning schemes for multiprocessor real-time systems which allow higher processor utilization and enhanced schedulability by using exact...
154
click to vote
JACM
2008
15 years 6 months ago
2008
We consider a failure-free, asynchronous message passing network with n links, where the processors are arranged on a ring or a chain. The processors are identically programmed bu...