Sciweavers

625 search results - page 77 / 125
» Approximating Travel Times Using Opportunistic Networking
Sort
View
ICCAD
2003
IEEE
161views Hardware» more  ICCAD 2003»
15 years 11 months ago
A General S-Domain Hierarchical Network Reduction Algorithm
This paper presents an efficient method to reduce complexities of a linear network in s-domain. The new method works on circuit matrices directly and reduces the circuit complexi...
Sheldon X.-D. Tan
CDC
2008
IEEE
204views Control Systems» more  CDC 2008»
15 years 8 months ago
Dynamic ping optimization for surveillance in multistatic sonar buoy networks with energy constraints
— In this paper we study the problem of dynamic optimization of ping schedule in an active sonar buoy network deployed to provide persistent surveillance of a littoral area throu...
Anshu Saksena, I-Jeng Wang
ICA3PP
2010
Springer
15 years 6 months ago
InterCloud: Utility-Oriented Federation of Cloud Computing Environments for Scaling of Application Services
Abstract. Cloud computing providers have setup several data centers at different geographical locations over the Internet in order to optimally serve needs of their customers aroun...
Rajkumar Buyya, Rajiv Ranjan, Rodrigo N. Calheiros
BIOINFORMATICS
2011
14 years 5 months ago
RINQ: Reference-based Indexing for Network Queries
We consider the problem of similarity queries in biological network databases. Given a database of networks, similarity query returns all the database networks whose similarity (i...
Günhan Gülsoy, Tamer Kahveci
NETWORKING
2007
15 years 3 months ago
Simple Models for the Performance Evaluation of a Class of Two-Hop Relay Protocols
We evaluate the performance of a class of two-hop relay protocols for mobile ad hoc networks. The interest is on the multicopy two-hop relay (MTR) protocol, where the source may ge...
Ahmad Al Hanbali, Arzad Alam Kherani, Philippe Nai...