Sciweavers

10608 search results - page 475 / 2122
» Complexity of O'Hara's Algorithm
Sort
View
AINA
2009
IEEE
15 years 11 months ago
A Fast and Memory Efficient Dynamic IP Lookup Algorithm Based on B-Tree
—This paper deals with the traditional IP address lookup problem with fast updates. We propose a B-tree data structure, called MMSPT (Multiway Most Specific Prefix Tree), which i...
Yeim-Kuan Chang, Yung-Chieh Lin
FOCS
2008
IEEE
15 years 11 months ago
Lower Bounds for Noisy Wireless Networks using Sampling Algorithms
We show a tight lower bound of Ω(N log log N) on the number of transmissions required to compute several functions (including the parity function and the majority function) in a...
Chinmoy Dutta, Jaikumar Radhakrishnan
CEC
2007
IEEE
15 years 11 months ago
Light beam search based multi-objective optimization using evolutionary algorithms
Abstract— For the past decade or so, evolutionary multiobjective optimization (EMO) methodologies have earned wide popularity for solving complex practical optimization problems,...
Kalyanmoy Deb, Abhay Kumar
IPPS
2007
IEEE
15 years 11 months ago
Time Series Forecasting by means of Evolutionary Algorithms
Many physical and artificial phenomena can be described by time series. The prediction of such phenomenon could be as complex as interesting. There are many time series forecasti...
Cristóbal Luque del Arco-Calderón, J...
137
Voted
ICPADS
2005
IEEE
15 years 10 months ago
Distributed Spanning Tree Algorithms for Large Scale Traversals
— The Distributed Spanning Tree (DST) is an overlay structure designed to be scalable. It supports the growth from small scale to large scale. The DST is a tree without bottlenec...
Sylvain Dahan