Sciweavers

632 search results - page 70 / 127
» On Routing in Circulant Graphs
Sort
View
74
Voted
ESWS
2006
Springer
15 years 1 months ago
Content Aggregation on Knowledge Bases Using Graph Clustering
Recently, research projects such as PADLR and SWAP have developed tools like Edutella or Bibster, which are targeted at establishing peer-to-peer knowledge management (P2PKM) syste...
Christoph Schmitz, Andreas Hotho, Robert Jäsc...
ENDM
2002
84views more  ENDM 2002»
14 years 9 months ago
Addressing the Petersen graph
Motivated by a problem on message routing in communication networks, Graham and Pollak proposed a scheme for addressing the vertices of a graph G by N-tuples of three symbols in s...
Randall J. Elzinga, David A. Gregory, Kevin N. Van...
OTM
2007
Springer
15 years 4 months ago
Self-healing in Binomial Graph Networks
The number of processors embedded in high performance computing platforms is growing daily to solve larger and more complex problems. However, as the number of components increases...
Thara Angskun, George Bosilca, Jack Dongarra
ATMOS
2010
150views Optimization» more  ATMOS 2010»
14 years 8 months ago
Dynamic Graph Generation and Dynamic Rolling Horizon Techniques in Large Scale Train Timetabling
The aim of the train timetabling problem is to find a conflict free timetable for a set of passenger and freight trains along their routes in an infrastructure network. Several ...
Frank Fischer, Christoph Helmberg
DIALM
2005
ACM
203views Algorithms» more  DIALM 2005»
14 years 12 months ago
Topological hole detection in wireless sensor networks and its applications
The identification of holes in a wireless sensor network is of primary interest since the breakdown of sensor nodes in a larger area often indicates one of the special events to ...
Stefan Funke