278 search results - page 18 / 56 » Two Upper Bounds on the Chromatic Number |
STACS
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. It is well-known that no classical algorithm can solve exactly (i.e., in bounded time without error) the leader election problem in anonymous networks. This paper propose...
IJBC
2006
13 years 8 months ago
2006
This paper deals with the problem of finding upper bounds on the number of periodic solutions of a class of one-dimensional non-autonomous differential equations: those with the r...
JGT
2010
13 years 7 months ago
2010
Let G(V, E) be a simple, undirected graph where V is the set of vertices and E is the set of edges. A b-dimensional cube is a Cartesian product I1 × I2 × · · · × Ib, where ea...
VLDB
1991
ACM
13 years 12 months ago
1991
ACM
Thrashing in transactionprocessingsystemscan be prevented by controlling the number of concurrently running transactions. Becausethe optimal concurrency level strongly dependson t...
ICCAD
1997
IEEE
14 years 20 days ago
1997
IEEE
Maximum instantaneous power in VLSI circuits has a great impact on circuit's reliability and the design of power and ground lines. To synthesizehighlyreliablesystems,accurate...