276 search results - page 11 / 56 » glogin - Interactive Connectivity for the Grid |
EURODAC
1994
IEEE
14 years 17 days ago
1994
IEEE
This paper addresses the problem of design rule correct routing, i.e. the avoidance of illegal wiring patterns during routing. These illegal wiring patterns are due to the set of ...
GD
2008
Springer
13 years 9 months ago
2008
Springer
In this paper we present a generalization of the shift method algorithm [4, 6] to obtain a straight-line grid drawing of a triconnected graph, where vertex representations have a c...
INFOCOM
2003
IEEE
14 years 1 months ago
2003
IEEE
Abstract— We consider an unreliable wireless sensor gridnetwork with n nodes placed in a square of unit area. We are interested in the coverage of the region and the connectivity...
DCG
2011
13 years 3 months ago
2011
We introduce an algorithm that embeds a given 3-connected planar graph as a convex 3-polytope with integer coordinates. The size of the coordinates is bounded by O(27.55n ) = O(18...
CCGRID
2006
IEEE
14 years 5 days ago
2006
IEEE
Next-generation e-Science applications will require the ability to transfer information at high data rates between distributed computing centers and data repositories. A LambdaGri...