488 search results - page 93 / 98 » Automorphic Decompositions of Graphs |
ICRA
2006
IEEE
14 years 1 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...
COMPGEOM
2004
ACM
14 years 1 months ago
2004
ACM
For a set S of points in Rd, an s-spanner is a graph on S such that any pair of points is connected via some path in the spanner whose total length is at most s times the Euclidea...
FOCS
2003
IEEE
14 years 1 months ago
2003
IEEE
The doubling constant of a metric space (X, d) is the smallest value λ such that every ball in X can be covered by λ balls of half the radius. The doubling dimension of X is the...
ICCAD
2000
IEEE
14 years 7 days ago
2000
IEEE
–An FPGA switch box is said to be hyper-universal if it is routable for all possible surrounding multi-pin net topologies satisfying the routing resource constraints. It is desir...
DSVIS
1994
Springer
13 years 11 months ago
1994
Springer
This paper presents a complete model-based approach to the building of presentation for a business oriented highly interactive application. This approach is considered complete in...