Sciweavers

1259 search results - page 93 / 252
» On Survivable Access Network Design: Complexity and Algorith...
Sort
View
138
Voted
CEC
2010
IEEE
15 years 5 months ago
Two novel Ant Colony Optimization approaches for Bayesian network structure learning
Learning Bayesian networks from data is an N-P hard problem with important practical applications. Several researchers have designed algorithms to overcome the computational comple...
Yanghui Wu, John A. W. McCall, David W. Corne
PIMRC
2008
IEEE
15 years 11 months ago
An optimization framework for the joint routing and scheduling in Wireless Mesh Networks
—In this paper, we address the problem of computing the transport capacity of Wireless Mesh Networks dedicated to Internet access. Routing and transmission scheduling have a majo...
Christelle Molle, Fabrice Peix, Hervé Rivan...
GLVLSI
2009
IEEE
154views VLSI» more  GLVLSI 2009»
15 years 11 months ago
Design of a maximum-likelihood detector for cooperative communications in intersymbol interference channels
Recently, cooperative communication has attracted a lot of attention for its potential to increase spatial diversity. However, limited attention has been paid to the physical laye...
Yanjie Peng, Andrew G. Klein, Xinming Huang
GLOBECOM
2010
IEEE
15 years 2 months ago
Distributed Scheduling and Routing in Underwater Wireless Networks
Abstract--Several underwater network characteristics, including long propagation delays and a bandwidth dependent on distance, provide unique challenges to protocol designers. In t...
Kurtis B. Kredo II, Prasant Mohapatra
SIGCOMM
2003
ACM
15 years 10 months ago
Forwarding in a content-based network
This paper presents an algorithm for content-based forwarding, an essential function in content-based networking. Unlike in traditional address-based unicast or multicast networks...
Antonio Carzaniga, Alexander L. Wolf