Sciweavers

581 search results - page 50 / 117
» Approximation algorithms for constructing wavelength routing...
Sort
View
CEC
2003
IEEE
15 years 6 months ago
Comparing neural networks and Kriging for fitness approximation in evolutionary optimization
Neural networks and the Kriging method are compared for constructing £tness approximation models in evolutionary optimization algorithms. The two models are applied in an identica...
Lars Willmes, Thomas Bäck, Yaochu Jin, Bernha...
INFOCOM
2008
IEEE
15 years 7 months ago
Reducing Maximum Stretch in Compact Routing
—It is important in communication networks to use routes that are as short as possible (i.e have low stretch) while keeping routing tables small. Recent advances in compact routi...
Mihaela Enachescu, Mei Wang, Ashish Goel
SIGMOD
2011
ACM
206views Database» more  SIGMOD 2011»
14 years 4 months ago
Sampling based algorithms for quantile computation in sensor networks
We study the problem of computing approximate quantiles in large-scale sensor networks communication-efficiently, a problem previously studied by Greenwald and Khana [12] and Shri...
Zengfeng Huang, Lu Wang, Ke Yi, Yunhao Liu
COMCOM
2008
127views more  COMCOM 2008»
15 years 1 months ago
A dynamic routing protocol for keyword search in unstructured peer-to-peer networks
The idea of building query-oriented routing indices has changed the way of improving keyword search efficiency from the basis as it can learn the content distribution from the que...
Cong Shi, Dingyi Han, Yuanjie Liu, Shicong Meng, Y...
CIKM
2005
Springer
15 years 7 months ago
Query workload-aware overlay construction using histograms
Peer-to-peer (p2p) systems offer an efficient means of data sharing among a dynamically changing set of a large number of autonomous nodes. Each node in a p2p system is connected...
Georgia Koloniari, Yannis Petrakis, Evaggelia Pito...