Sciweavers

632 search results - page 29 / 127
» On Routing in Circulant Graphs
Sort
View
ENTCS
2007
190views more  ENTCS 2007»
13 years 9 months ago
Modelling Multicast QoS Routing by using Best-Tree Search in And-or Graphs and Soft Constraint Logic Programming
We suggest a formal model to represent and solve the multicast routing problem in multicast networks. To attain this, we model the network adapting it to a weighted and-or graph, ...
Stefano Bistarelli, Ugo Montanari, Francesca Rossi...
WG
2004
Springer
14 years 3 months ago
Collective Tree Spanners and Routing in AT-free Related Graphs
In this paper we study collective additive tree spanners for families of graphs that either contain or are contained in AT-free graphs. We say that a graph G = (V, E) admits a sys...
Feodor F. Dragan, Chenyu Yan, Derek G. Corneil
FPGA
1998
ACM
142views FPGA» more  FPGA 1998»
14 years 2 months ago
A Hybrid Complete-Graph Partial-Crossbar Routing Architecture for Multi-FPGA Systems
Multi-FPGA systems (MFSs) are used as custom computing machines, logic emulators and rapid prototyping vehicles. A key aspect of these systems is their programmable routing archit...
Mohammed A. S. Khalid, Jonathan Rose
PODC
2003
ACM
14 years 3 months ago
Scaling properties of the Internet graph
As the Internet grows in size, it becomes crucial to understand how the speeds of links in the network must improve in order to sustain the pressure of new end-nodes being added e...
Aditya Akella, Shuchi Chawla, Arvind Kannan, Srini...
SPATIALCOGNITION
2000
Springer
14 years 1 months ago
Modelling Navigational Knowledge by Route Graphs
Navigation has always been an interdisciplinary topic of research, because mobile agents of different types are inevitably faced with similar navigational problems. Therefore, huma...
Steffen Werner, Bernd Krieg-Brückner, Theo He...