383 search results - page 22 / 77 » A Bound on the Total Chromatic Number |
IPPS
1998
IEEE
13 years 12 months ago
1998
IEEE
Fully-populated tori, where every node has a processor attached, do not scale well since load on edges increases superlinearly with network size under heavy communication, resulti...
IPCO
1998
13 years 9 months ago
1998
Abstract. A well studied and difficult class of scheduling problems concerns parallel machines and precedence constraints. In order to model more realistic situations, we consider ...
ORDER
2008
13 years 7 months ago
2008
Given a poset P = (X, ), a partition X1, . . . , Xk of X is called an ordered partition of P if, whenever x Xi and y Xj with x y, then i j. In this paper, we show that for ever...
IPSN
2005
Springer
14 years 1 months ago
2005
Springer
— We consider the problem of energy efficient random deployment of sensor network. Our goal is to find the sensor node density, or alternatively, the energy resource density at e...
STOC
1995
ACM
13 years 11 months ago
1995
ACM
We show that a parallel repetition of any two-prover one-round proof system (MIP(2, 1)) decreases the probability of error at an exponential rate. No constructive bound was previou...