Sciweavers

1520 search results - page 96 / 304
» The Ring Loading Problem
Sort
View
OPODIS
2008
14 years 11 months ago
Rendezvous of Mobile Agents When Tokens Fail Anytime
Abstract. We consider the problem of Rendezvous or gathering of multiple autonomous entities (called mobile agents) moving in an unlabelled environment (modelled as a graph). The p...
Shantanu Das, Matús Mihalák, Rastisl...
JCB
2007
168views more  JCB 2007»
14 years 10 months ago
Fast Molecular Shape Matching Using Contact Maps
In this paper, we study the problem of computing the similarity of two protein structures ring their contact-map overlap. Contact-map overlap abstracts the problem of computing th...
Pankaj K. Agarwal, Nabil H. Mustafa, Yusu Wang
IPPS
2003
IEEE
15 years 3 months ago
Using Golomb Rulers for Optimal Recovery Schemes in Fault Tolerant Distributed Computing
Clusters and distributed systems offer fault tolerance and high performance through load sharing. When all computers are up and running, we would like the load to be evenly distrib...
Kamilla Klonowska, Lars Lundberg, Håkan Lenn...
CEE
2006
75views more  CEE 2006»
14 years 10 months ago
Survivability and performance optimization of mobile wireless communication networks in the event of base station failure
In this paper, we investigate the survivability of mobile wireless communication networks in the event of base station (BS) failure. A survivable network is modeled as a mathemati...
Kuo-Chung Chu, Frank Yeong-Sung Lin
TON
1998
186views more  TON 1998»
14 years 9 months ago
Virtual path control for ATM networks with call level quality of service guarantees
— The configuration of virtual path (VP) connection services is expected to play an important role in the operation of large-scale asynchronous transfer mode (ATM) networks. A m...
Nikolaos Anerousis, Aurel A. Lazar