Sciweavers

625 search results - page 38 / 125
» Approximating Travel Times Using Opportunistic Networking
Sort
View
MOBIHOC
2007
ACM
15 years 11 months ago
Approximation algorithms for longest-lived directional multicast communications in WANETs
Several centralized and distributed algorithms have been recently proposed to maximize the multicast lifetime for directional communications in wireless ad-hoc networks. Their per...
Song Guo, Oliver W. W. Yang, Victor C. M. Leung
ASC
2007
14 years 12 months ago
An approximate stability analysis of nonlinear systems described by Universal Learning Networks
Stability is one of the most important subjects in control systems. As for the stability of nonlinear dynamical systems, Lyapunov’s direct method and linearized stability analys...
Kotaro Hirasawa, Shingo Mabu, Shinji Eto, Jinglu H...
DSN
2011
IEEE
13 years 11 months ago
Approximate analysis of blocking queueing networks with temporal dependence
—In this paper we extend the class of MAP queueing networks to include blocking models, which are useful to describe the performance of service instances which have a limited con...
Vittoria de Nitto Persone, Giuliano Casale, Evgeni...
BMCBI
2007
197views more  BMCBI 2007»
14 years 12 months ago
Boolean networks using the chi-square test for inferring large-scale gene regulatory networks
Background: Boolean network (BN) modeling is a commonly used method for constructing gene regulatory networks from time series microarray data. However, its major drawback is that...
Haseong Kim, Jae K. Lee, Taesung Park
DIALM
2003
ACM
113views Algorithms» more  DIALM 2003»
15 years 5 months ago
Multicast time maximization in energy constrained wireless networks
We consider the problem of maximizing the lifetime of a given multicast connection in a wireless network of energyconstrained (e.g. battery-operated) nodes, by choosing ideal tran...
Patrik Floréen, Petteri Kaski, Jukka Kohone...