599 search results - page 40 / 120 » The repeater tree construction problem |
171
click to vote
CONCUR
2006
Springer
15 years 8 months ago
2006
Springer
In regular inference, the problem is to infer a regular language, typically represented by a deterministic finite automaton (DFA) from answers to a finite set of membership querie...
168
click to vote
ESA
1998
Springer
15 years 10 months ago
1998
Springer
Information retrieval and data compression are the two main application areas where the rich theory of string algorithmics plays a fundamental role. In this paper, we consider one ...
169
click to vote
MONET
2006
15 years 6 months ago
2006
In this paper we address the minimum-energy broadcast problem in multi-hop wireless networks, so that all broadcast requests initiated by different source nodes take place on the s...
166
click to vote
EUROPAR
2004
Springer
15 years 11 months ago
2004
Springer
In hot-potato (deflection) routing, nodes in the network have no buffers for packets in transit, so that some conflicting packets must be deflected away from their destination...
158
click to vote
SPAA
2005
ACM
15 years 11 months ago
2005
ACM
An asynchronous algorithm is described for rapidly constructing an overlay network in a peer-to-peer system where all nodes can in principle communicate with each other directly t...