Sciweavers

2842 search results - page 158 / 569
» Expansion and Search in Networks
Sort
View
NETWORKING
2008
15 years 8 months ago
The CPBT: A Method for Searching the Prefixes Using Coded Prefixes in B-Tree
Due to the increasing size of IP routing table and the growing rate of their lookups, many algorithms are introduced to achieve the required speed in table search and update or opt...
Mohammad Behdadfar, Hossein Saidi
NOMS
2002
IEEE
127views Communications» more  NOMS 2002»
15 years 11 months ago
Intelligent search of correlated alarms from database containing noise data
Alarm correlation plays an important role in improving the service and reliability in modern telecommunication networks. Most previous research of alarm correlation didn’t consi...
Qingguo Zheng, Ke Xu, Weifeng Lv, Shilong Ma
NN
2002
Springer
136views Neural Networks» more  NN 2002»
15 years 6 months ago
Bayesian model search for mixture models based on optimizing variational bounds
When learning a mixture model, we suffer from the local optima and model structure determination problems. In this paper, we present a method for simultaneously solving these prob...
Naonori Ueda, Zoubin Ghahramani
SEMWEB
2010
Springer
15 years 4 months ago
Preference-Based Web Service Composition: A Middle Ground between Execution and Search
Abstract. Much of the research on automated Web Service Composition (WSC) relates it to an AI planning task, where the composition is primarily done offline prior to execution. Rec...
Shirin Sohrabi, Sheila A. McIlraith
CEC
2008
IEEE
16 years 29 days ago
Learning what to ignore: Memetic climbing in topology and weight space
— We present the memetic climber, a simple search algorithm that learns topology and weights of neural networks on different time scales. When applied to the problem of learning ...
Julian Togelius, Faustino J. Gomez, Jürgen Sc...