Sciweavers

3008 search results - page 524 / 602
» Independence in connected graphs
Sort
View
ISAAC
2001
Springer
118views Algorithms» more  ISAAC 2001»
15 years 10 months ago
On Adaptive Fault Diagnosis for Multiprocessor Systems
Abstract. We first consider adaptive serial diagnosis for multiprocessor systems. We present an adaptive diagnosis algorithm using N + t − 1 tests, which is the smallest possibl...
Kumiko Nomura, Toshinori Yamada, Shuichi Ueno
INFOCOM
2000
IEEE
15 years 10 months ago
Efficient Handoff Rerouting Algorithms: A Competitive On-Line Algorithmic Approach
—This paper considers the design of handoff rerouting algorithms for reducing the overall session cost in personal communication systems (PCS). Most modern communication systems ...
Yigal Bejerano, Israel Cidon, Joseph Naor
SP
1998
IEEE
116views Security Privacy» more  SP 1998»
15 years 10 months ago
Strand Spaces: Why is a Security Protocol Correct?
A strand is a sequence of events; it represents either the execution of legitimate party in a security protocol or else a sequence of actions by a penetrator. A strand space is a ...
F. Javier Thayer, Jonathan C. Herzog, Joshua D. Gu...
SPAA
1997
ACM
15 years 10 months ago
System Area Network Mapping
: This paper presents a network mapping algorithm and proves its correctness assuming a traffic-free network. Respecting well-defined parameters, the algorithm produces a graph iso...
Brent N. Chun, Alan M. Mainwaring, Saul Schleimer,...
PDIS
1996
IEEE
15 years 10 months ago
Querying the World Wide Web
The World Wide Web is a large, heterogeneous, distributedcollectionof documents connected by hypertext links. The most common technologycurrently used for searching the Web depend...
Alberto O. Mendelzon, George A. Mihaila, Tova Milo