Sciweavers

13214 search results - page 134 / 2643
» Pseudorandomness for network algorithms
Sort
View
ASPDAC
2007
ACM
121views Hardware» more  ASPDAC 2007»
15 years 10 months ago
Approximation Algorithm for Process Mapping on Network Processor Architectures
The high performance requirements of networking applications has led to the advent of programmable network processor (NP) architectures that incorporate symmetric multiprocessing, ...
Christopher Ostler, Karam S. Chatha, Goran Konjevo...
JUCS
2008
153views more  JUCS 2008»
15 years 6 months ago
Bus Network Optimization with a Time-Dependent Hybrid Algorithm
: This paper describes a new hybrid technique that combines a Greedy Randomized Adaptive Search Procedure (GRASP) and a genetic algorithm with simulation features in order to solve...
Ana C. Olivera, Mariano Frutos, Jessica Andrea Car...
HICSS
2002
IEEE
132views Biometrics» more  HICSS 2002»
15 years 11 months ago
New Distributed Algorithm for Connected Dominating Set in Wireless Ad Hoc Networks
—Connected dominating set (CDS) has been proposed as virtual backbone or spine of wireless ad hoc networks. Three distributed approximation algorithms have been proposed in the l...
Khaled M. Alzoubi, Peng-Jun Wan, Ophir Frieder
FGCN
2008
IEEE
240views Communications» more  FGCN 2008»
16 years 28 days ago
Data Compression Algorithm Based on Hierarchical Cluster Model for Sensor Networks
A new distributed algorithm of data ccompression based on hierarchical cluster model for sensor networks is proposed, the basic ideas of which are as follows, firstly the whole se...
Tongsen Wang, Lei Wang, Zhijun Xie, Ronghua Yang
AUSAI
2004
Springer
15 years 12 months ago
Genetic Algorithm Based K-Means Fast Learning Artificial Neural Network
The K-means Fast Learning Artificial Neural Network (KFLANN) is a small neural network bearing two types of parameters, the tolerance, δ and the vigilance, µ. In previous papers,...
Yin Xiang, Alex Leng Phuan Tay