Sciweavers

3359 search results - page 111 / 672
» A Simplified Idea Algorithm
Sort
View
DAC
2003
ACM
16 years 3 months ago
An O(nlogn) time algorithm for optimal buffer insertion
The classic algorithm for optimal buffer insertion due to van Ginneken has time and space complexity O(n2 ), where n is the number of possible buffer positions. We present a new a...
Weiping Shi, Zhuo Li
CEC
2009
IEEE
15 years 7 months ago
Distributed genetic algorithm using automated adaptive migration
—We present a new distributed genetic algorithm that can be used to extract useful information from distributed, large data over the network. The main idea of the proposed algori...
Hyunjung Lee, Byonghwa Oh, Jihoon Yang, Seonho Kim
SODA
2004
ACM
110views Algorithms» more  SODA 2004»
15 years 3 months ago
Probabilistic analysis of knapsack core algorithms
We study the average-case performance of algorithms for the binary knapsack problem. Our focus lies on the analysis of so-called core algorithms, the predominant algorithmic conce...
René Beier, Berthold Vöcking
WCE
2007
15 years 3 months ago
A Fast Multivariate Nearest Neighbour Imputation Algorithm
— Imputation of missing data is important in many areas, such as reducing non-response bias in surveys and maintaining medical documentation. Nearest neighbour (NN) imputation al...
Norman Solomon, Giles Oatley, Kenneth McGarry
142
Voted
JNW
2008
124views more  JNW 2008»
15 years 2 months ago
A Position Based Ant Colony Routing Algorithm for Mobile Ad-hoc Networks
Position based routing algorithms use the knowledge of the position of nodes for routing of packets in mobile ad-hoc networks. Previously proposed position based routing algorithms...
Shahab Kamali, Jaroslav Opatrny