599 search results - page 91 / 120 » The repeater tree construction problem |
155
click to vote
ICN
2001
Springer
15 years 10 months ago
2001
Springer
This paper addresses multicast routing in multi-hop optical networks employing wavelength-division multiplexing (WDM). We consider a model in which multicast communication requests...
142
click to vote
ACSD
2005
IEEE
15 years 11 months ago
2005
IEEE
We present a bundled data communication scheme that is robust to crosstalk effects, and to manufacturing and environmental variations. Unlike a data bus, where each receiver alway...
133
click to vote
WG
2005
Springer
15 years 11 months ago
2005
Springer
The NP-complete Closest 4-Leaf Power problem asks, given an undirected graph, whether it can be modified by at most edge insertions or deletions such that it becomes a 4-leaf powe...
156
click to vote
SMA
2003
ACM
15 years 11 months ago
2003
ACM
This paper has two parts. First, we propose a method which can be used to decompose a geometric constraint graph into a c-tree. With this decomposition, solving for a well-constrai...
147
click to vote
TPHOL
1999
IEEE
15 years 10 months ago
1999
IEEE
We present a development of Universal Algebra inside Type Theory, formalized using the proof assistant Coq. We define the notion of a signature and of an algebra over a signature. ...