Sciweavers

2842 search results - page 305 / 569
» Expansion and Search in Networks
Sort
View
JCM
2007
131views more  JCM 2007»
15 years 6 months ago
Routing in Optical and Non-Optical Networks using Boolean Satisfiability
—Today, most routing problems are solved using Dijkstra’s shortest path algorithm. Many efficient implementations of Dijkstra’s algorithm exist and can handle large networks ...
Fadi A. Aloul, Bashar Al Rawi, Mokhtar Aboelaze
INFOCOM
1998
IEEE
15 years 11 months ago
Design of Logical Topologies: A Linear Formulation for Wavelength Routed Optical Networks with No Wavelength Changers
We consider the problem of constructing logical topologies over a wavelength-routed optical network with no wavelength changers. We present a general linear formulation which consi...
Rajesh M. Krishnaswamy, Kumar N. Sivarajan
DL
1998
Springer
180views Digital Library» more  DL 1998»
15 years 11 months ago
Automatic Subject Indexing Using an Associative Neural Network
The global growth in popularity of the World Wide Web has been enabled in part by the availability of browser based search tools which in turn have led to an increased demand for ...
Yi-Ming Chung, William M. Pottenger, Bruce R. Scha...
ICASSP
2010
IEEE
15 years 7 months ago
Distributed learning in cognitive radio networks: Multi-armed bandit with distributed multiple players
—We consider a cognitive radio network with distributed multiple secondary users, where each user independently searches for spectrum opportunities in multiple channels without e...
Keqin Liu, Qing Zhao
FUIN
2008
108views more  FUIN 2008»
15 years 5 months ago
Learning Ground CP-Logic Theories by Leveraging Bayesian Network Learning Techniques
Causal relations are present in many application domains. Causal Probabilistic Logic (CP-logic) is a probabilistic modeling language that is especially designed to express such rel...
Wannes Meert, Jan Struyf, Hendrik Blockeel