Sciweavers

1738 search results - page 82 / 348
» An algorithmic framework for network reconstruction
Sort
View
INFOCOM
2007
IEEE
15 years 10 months ago
Polynomial Complexity Algorithms for Full Utilization of Multi-Hop Wireless Networks
— In this paper, we propose and study a general framework that allows the development of distributed mechanisms to achieve full utilization of multi-hop wireless networks. In par...
Atilla Eryilmaz, Asuman E. Ozdaglar, Eytan Modiano
147
Voted
GECCO
2006
Springer
220views Optimization» more  GECCO 2006»
15 years 7 months ago
Comparing evolutionary algorithms on the problem of network inference
In this paper, we address the problem of finding gene regulatory networks from experimental DNA microarray data. We focus on the evaluation of the performance of different evoluti...
Christian Spieth, Rene Worzischek, Felix Streicher...
NETCOOP
2007
Springer
15 years 10 months ago
Transit Prices Negotiation: Combined Repeated Game and Distributed Algorithmic Approach
— We present both a game theoretic and a distributed algorithmic approach for the transit price negotiation problem in the interdomain routing framework. We analyze the behavior ...
Dominique Barth, Johanne Cohen, Loubna Echabbi, Ch...
JHSN
2000
172views more  JHSN 2000»
15 years 3 months ago
Dynamic token bucket (DTB): a fair bandwidth allocation algorithm for high-speed networks
Fair allocation of available bandwidth to competing flows is a simple form of quality of service (QoS) that can be provided to customers in packet-switched networks. A number of p...
Jayakrishna Kidambi, Dipak Ghosal, Biswanath Mukhe...
ICNS
2006
IEEE
15 years 10 months ago
Anycast Algorithms Supporting Optical Burst Switched Grid Networks
— In this paper we consider implementing optical burst switching as a technology for building Grids with computationally intensive requirements. This architecture has been referr...
Marc De Leenheer, Farid Farahmand, Kejie Lu, Tao Z...