Sciweavers

51 search results - page 10 / 11
» Cayley graphs as models of deterministic small-world network...
Sort
View
WADS
2009
Springer
226views Algorithms» more  WADS 2009»
14 years 28 days ago
Online Priority Steiner Tree Problems
Abstract. A central issue in the design of modern communication networks is the provision of Quality-of-Service (QoS) guarantees at the presence of heterogeneous users. For instanc...
Spyros Angelopoulos
NETWORK
2007
234views more  NETWORK 2007»
13 years 5 months ago
Surveillance Wireless Sensor Networks: Deployment Quality Analysis
Surveillance wireless sensor networks are deployed at perimeter or border locations to detect unauthorized intrusions. For deterministic deployment of sensors, the quality of depl...
Ertan Onur, Cem Ersoy, Hakan Deliç, Lale Ak...
OPODIS
2008
13 years 7 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...
IPPS
1999
IEEE
13 years 10 months ago
Reducing I/O Complexity by Simulating Coarse Grained Parallel Algorithms
Block-wise access to data is a central theme in the design of efficient external memory (EM) algorithms. A second important issue, when more than one disk is present, is fully par...
Frank K. H. A. Dehne, David A. Hutchinson, Anil Ma...
AAAI
2008
13 years 8 months ago
CIGAR: Concurrent and Interleaving Goal and Activity Recognition
In artificial intelligence and pervasive computing research, inferring users' high-level goals from activity sequences is an important task. A major challenge in goal recogni...
Derek Hao Hu, Qiang Yang