Sciweavers

13214 search results - page 2528 / 2643
» Pseudorandomness for network algorithms
Sort
View
SLIP
2003
ACM
15 years 9 months ago
Perimeter-degree: a priori metric for directly measuring and homogenizing interconnection complexity in multilevel placement
In this paper, we describe an accurate metric (perimeter-degree) for measuring interconnection complexity and effective use of it for controlling congestion in a multilevel framew...
Navaratnasothie Selvakkumaran, Phiroze N. Parakh, ...
CCS
2003
ACM
15 years 9 months ago
DoS protection for UDP-based protocols
Since IP packet reassembly requires resources, a denial of service attack can be mounted by swamping a receiver with IP fragments. In this paper we argue how this attack need not ...
Charlie Kaufman, Radia J. Perlman, Bill Sommerfeld
AINA
2010
IEEE
15 years 9 months ago
Grid of Segment Trees for Packet Classification
—Packet classification problem has received much attention and continued to be an important topic in recent years. In packet classification problem, each incoming packet should b...
Yeim-Kuan Chang, Yung-Chieh Lin, Chen-Yu Lin
GECCO
2010
Springer
173views Optimization» more  GECCO 2010»
15 years 9 months ago
Evolving the placement and density of neurons in the hyperneat substrate
The Hypercube-based NeuroEvolution of Augmenting Topologies (HyperNEAT) approach demonstrated that the pattern of weights across the connectivity of an artificial neural network ...
Sebastian Risi, Joel Lehman, Kenneth O. Stanley
IJCNN
2000
IEEE
15 years 8 months ago
Regression Analysis for Rival Penalized Competitive Learning Binary Tree
The main aim of this paper is to develop a suitable regression analysis model for describing the relationship between the index efficiency and the parameters of the Rival Penaliz...
Xuequn Li, Irwin King
« Prev « First page 2528 / 2643 Last » Next »