Results 1  10
of
431,790
Understanding FaultTolerant Distributed Systems
 COMMUNICATIONS OF THE ACM
, 1993
"... We propose a small number of basic concepts that can be used to explain the architecture of faulttolerant distributed systems and we discuss a list of architectural issues that we find useful to consider when designing or examining such systems. For each issue we present known solutions and design ..."
Abstract

Cited by 374 (23 self)
 Add to MetaCart
We propose a small number of basic concepts that can be used to explain the architecture of faulttolerant distributed systems and we discuss a list of architectural issues that we find useful to consider when designing or examining such systems. For each issue we present known solutions and design
Distributed Algorithms for Coloring Interval Graphs?
"... Abstract. We explore the question how well we can color graphs in distributed models, especially in graph classes for which ∆+ 1colorings provide no approximation guarantees. We particularly focus on interval graphs. In the LOCAL model, we give an algorithm that computes a constant factor approxima ..."
Abstract
 Add to MetaCart
Abstract. We explore the question how well we can color graphs in distributed models, especially in graph classes for which ∆+ 1colorings provide no approximation guarantees. We particularly focus on interval graphs. In the LOCAL model, we give an algorithm that computes a constant factor
Sum MultiColoring of Graphs (Extended Abstract)
, 1999
"... Scheduling dependent jobs on multiple machines is modeled by the graph multicoloring problem. In this paper, we consider the problem of minimizing the average completion time of all jobs. This is equivalent to the following coloring problem: Given a graph and the number of colors required by each ..."
Abstract
 Add to MetaCart
Scheduling dependent jobs on multiple machines is modeled by the graph multicoloring problem. In this paper, we consider the problem of minimizing the average completion time of all jobs. This is equivalent to the following coloring problem: Given a graph and the number of colors required by each
Multicolor Pebble Motion on Graphs
, 2008
"... We consider a graph with n vertices, and p < n pebbles of m colors. A pebble move consists of transferring a pebble from its current host vertex to an adjacent unoccupied vertex. The problem is to move the pebbles to a given new color arrangement. We study the feasibility version of the problem ..."
Abstract

Cited by 8 (0 self)
 Add to MetaCart
 does a given instance have a solution? We use an algorithm of [6] for the problem where each pebble has a distinct color to give a linear time algorithm for the feasibility decision problem on a general graph. 1
An Algorithmic Approach for Multicolor Ramsey Graphs
, 1987
"... An algorithmic approach for multicolor Ramsey graphs ..."
Multicolor and artistic dithering
 In SIGGRAPH 99
, 1999
"... A multicolor dithering algorithm is proposed, which converts a barycentric combination of color intensities into a multicolor nonoverlapping surface coverage. Multicolor dithering is a generalization of standard bilevel dithering. Combined with tetrahedral color separation, multicolor dithering ..."
Abstract

Cited by 21 (3 self)
 Add to MetaCart
A multicolor dithering algorithm is proposed, which converts a barycentric combination of color intensities into a multicolor nonoverlapping surface coverage. Multicolor dithering is a generalization of standard bilevel dithering. Combined with tetrahedral color separation, multicolor
Minimum sum multicoloring on the edges of trees
, 2003
"... The edge multicoloring problem is that given a graph G and integer demands x(e) for every edge e, assign a set of x(e) colors to edge e, such that adjacent edges have disjoint sets of colors. In the minimum sum edge multicoloring problem the finish time of an edge is defined to be the highest color ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
The edge multicoloring problem is that given a graph G and integer demands x(e) for every edge e, assign a set of x(e) colors to edge e, such that adjacent edges have disjoint sets of colors. In the minimum sum edge multicoloring problem the finish time of an edge is defined to be the highest color
On Sum Coloring and Sum MultiColoring for Restricted Families of Graphs
"... We consider the sum coloring (chromatic sum) and sum multicoloring problems for restricted families of graphs. In particular, we consider the graph classes of proper intersection graphs of axisparallel rectangles, proper interval graphs, and unit disk graphs. All the above mentioned graph classes ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We consider the sum coloring (chromatic sum) and sum multicoloring problems for restricted families of graphs. In particular, we consider the graph classes of proper intersection graphs of axisparallel rectangles, proper interval graphs, and unit disk graphs. All the above mentioned graph
Network Centric Warfare: Developing and Leveraging Information Superiority
 Command and Control Research Program (CCRP), US DoD
, 2000
"... the mission of improving DoD’s understanding of the national security implications of the Information Age. Focusing upon improving both the state of the art and the state of the practice of command and control, the CCRP helps DoD take full advantage of the opportunities afforded by emerging technolo ..."
Abstract

Cited by 308 (5 self)
 Add to MetaCart
the mission of improving DoD’s understanding of the national security implications of the Information Age. Focusing upon improving both the state of the art and the state of the practice of command and control, the CCRP helps DoD take full advantage of the opportunities afforded by emerging
Results 1  10
of
431,790