Sciweavers

365 search results - page 19 / 73
» Reconfigurations in Graphs and Grids
Sort
View
ECUMN
2007
Springer
15 years 6 months ago
End-to-End Distance Computation in Grid Environment by NDS, the Network Distance Service
This article presents a novel method for computing distances between hosts in a computational Grid. Our method allows to represent the cost to achieve any operation involving some...
Julien Gossa, Jean-Marc Pierson
93
Voted
GCC
2003
Springer
15 years 5 months ago
Some Grid Automata for Grid Computing
We use 2-Dimensional language to construct 2-Dimensional computer graphics model, use MSO or other logics to specify some graph property, and use automata model checking technique ...
Hao Shen, Yongqiang Sun
COMPGEOM
2009
ACM
15 years 6 months ago
On grids in topological graphs
A topological graph is a graph drawn in the plane with vertices represented by points and edges as arcs connecting its vertices. A k-grid in a topological graph is a pair of edge ...
Eyal Ackerman, Jacob Fox, János Pach, Andre...
COLT
1993
Springer
15 years 3 months ago
Piecemeal Learning of an Unknown Environment
We introducea new learningproblem: learninga graph by piecemeal search, in which the learner must return every so often to its starting point (for refueling, say). We present two l...
Margrit Betke, Ronald L. Rivest, Mona Singh
SPDP
1993
IEEE
15 years 4 months ago
A Class of Hypercube-Like Networks
W e introduce a class of graphs which are variants of the hypercube graph. M a n y of the properties of this class of graphs are similar to that of the hypercube hence, we refer t...
Aniruddha S. Vaidya, P. S. Nagendra Rao, S. Ravi S...