Sciweavers

3625 search results - page 380 / 725
» On Timed Models of Gene Networks
Sort
View
186
Voted
ESA
2000
Springer
104views Algorithms» more  ESA 2000»
15 years 10 months ago
Efficient Algorithms for Centers and Medians in Interval and Circular-Arc Graphs
The p-center problem is to locate p facilities on a network so as to minimize the largest distance from a demand point to its nearest facility. The p-median problem is to locate p ...
Sergei Bespamyatnikh, Binay K. Bhattacharya, J. Ma...
BIOINFORMATICS
1999
65views more  BIOINFORMATICS 1999»
15 years 6 months ago
Genetic Simulation Library
Summary: The Genetic Simulation Library (GSL) is a set of C++ programs and classes that can be used in individualbased simulation models of plant and animal populations. The class...
John S. Conery, Michael Lynch
PRDC
2009
IEEE
16 years 1 months ago
An Early-Stopping Protocol for Computing Aggregate Functions in Sensor Networks
Abstract—In this paper, we study algebraic aggregate computations in Sensor Networks. The main contribution is the presentation of an early-stopping protocol that computes the av...
Antonio Fernández Anta, Miguel A. Mosteiro,...
TWC
2008
119views more  TWC 2008»
15 years 6 months ago
Flow-level performance of opportunistic OFDM-TDMA and OFDMA networks
Abstract--In this paper, the flow-level performance of opportunistic scheduling in orthogonal frequency division multiplexing (OFDM) networks is studied. The analysis accounts for ...
Lei Lei, Chuang Lin, Jun Cai, Xuemin Shen
DSN
2011
IEEE
14 years 6 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...