1205 search results - page 163 / 241 » On P Systems with Bounded Parallelism |
HPCA
2006
IEEE
14 years 8 months ago
2006
IEEE
Processor architects have a challenging task of evaluating a large design space consisting of several interacting parameters and optimizations. In order to assist architects in ma...
IPCO
1998
13 years 9 months ago
1998
We provide several non-approximability results for deterministic scheduling problems whose objective is to minimize the total job completion time. Unless P = NP, none of the probl...
CCCG
1993
13 years 9 months ago
1993
A k-dense corridor through a finite set, S, of n points in the plane is the open region of the plane that is bounded by two parallel lines that intersect the convex hull of S and ...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Let G = (V, E) be an undirected loopless graph with possible parallel edges and s, t V . Assume that s is labelled at the initial time step and that every labelled vertex copies i...
PODC
2006
ACM
14 years 1 months ago
2006
ACM
Coloring the nodes of a graph with a small number of colors is one of the most fundamental problems in theoretical computer science. In this paper, we study graph coloring in a di...