16666 search results - page 372 / 3334 » Descriptive and Computational Complexity |
187
click to vote
IPPS
2002
IEEE
15 years 11 months ago
2002
IEEE
Researchers are currently investigating applying benefit, or utility functions for allocating resources in limited, soft real time systems [1,2,3]. While the future of real -time ...
152
click to vote
PG
2002
IEEE
15 years 11 months ago
2002
IEEE
Flocking behavior is very common in nature, and there have been ongoing research efforts to simulate such behavior in computer animations and robotics applications. Generally, suc...
194
click to vote
WG
2001
Springer
15 years 11 months ago
2001
Springer
In a graph coloring, each color class induces a disjoint union of isolated vertices. A graph subcoloring generalizes this concept, since here each color class induces a disjoint un...
185
click to vote
ICDCN
2010
Springer
15 years 10 months ago
2010
Springer
Abstract. We re-visit the problem of perfectly secure message transmission (PSMT) in a directed network under the presence of a threshold adaptive Byzantine adversary, having unbou...
194
click to vote
APPROX
2008
Springer
15 years 8 months ago
2008
Springer
We study the complexity of locally list-decoding binary error correcting codes with good parameters (that are polynomially related to information theoretic bounds). We show that co...