1952 search results - page 351 / 391 » Complete partitions of graphs |
113
click to vote
AICT
2006
IEEE
15 years 10 months ago
2006
IEEE
— We give an optimal solution to the Maximum All Request Path Grooming (MARPG) problem motivated by a traffic grooming application. The MARPG problem consists in finding the ma...
132
click to vote
ICRA
2006
IEEE
15 years 10 months ago
2006
IEEE
– In this paper, we proposed an improved algorithm for the multi-robot complete coverage problem. Real world applications such as lawn mowing, chemical spill clean-up, and humani...
138
click to vote
SBACPAD
2006
IEEE
2006
IEEE
Scalable Parallel Implementation of Bayesian Network to Junction Tree Conversion for Exact Inference
15 years 10 months ago
We present a scalable parallel implementation for converting a Bayesian network to a junction tree, which can then be used for a complete parallel implementation for exact inferen...
114
click to vote
ACIVS
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. This article presents a new algorithm for spatial deinterlacing that could easily be integrated in a more complete deinterlacing system, typically a spatio-temporal motio...
143
click to vote
SPAA
2006
ACM
15 years 10 months ago
2006
ACM
Suppose we have a parallel or distributed system whose nodes have limited capacities, such as processing speed, bandwidth, memory, or disk space. How does the performance of the s...