765 search results - page 85 / 153 » Graph Coloring with Rejection |
APPROX
2006
Springer
14 years 16 days ago
2006
Springer
Motivated by applications in batch scheduling of jobs in manufacturing systems and distributed computing, we study two related problems. Given is a set of jobs {J1, . . . , Jn}, w...
CPC
2007
13 years 8 months ago
2007
Abstract. This paper is devoted to an online variant of the minimum spanning tree problem in randomly weighted graphs. We assume that the input graph is complete and the edge weigh...
PAMI
1998
13 years 8 months ago
1998
—This paper describes a new approach to matching geometric structure in 2D point-sets. The novel feature is to unify the tasks of estimating transformation geometry and identifyi...
ECRTS
2007
IEEE
14 years 3 months ago
2007
IEEE
Conventionally, the use of virtual memory in real-time systems has been avoided, the main reason being the difficulties it provides to timing analysis. However, there is a trend ...
SIROCCO
2000
13 years 10 months ago
2000
: We consider a well known distributed coloring game played on a simple connected graph: initially, each vertex is colored black or white; at each round, each vertex simultaneously...