Sciweavers

9949 search results - page 411 / 1990
» On the Network Complexity of Selection
Sort
View
SIMUTOOLS
2008
15 years 9 months ago
An OMNeT++ model for the evaluation of OBS routing strategies
Optical Burst Switching (OBS) has been proposed as a costeffective paradigm for supporting, with adequate flexibility, the increasingly high transmission capacity required by the ...
A. L. Barradas, M. C. R. Medeiros
IJON
2006
132views more  IJON 2006»
15 years 7 months ago
A binary neural decision table classifier
In this paper, we introduce a neural network -based decision table algorithm. We focus on the implementation details of the decision table algorithm when it is constructed using t...
Victoria J. Hodge, Simon O'Keefe, Jim Austin
ECAL
2007
Springer
16 years 1 months ago
Information-Cloning of Scale-Free Networks
In this paper1 , we introduce a method, Assortative Preferential Attachment, to grow a scale-free network with a given assortativeness value. Utilizing this method, we investigate ...
Piraveenan Mahendra, Mikhail Prokopenko, Albert Y....
ISAAC
2005
Springer
104views Algorithms» more  ISAAC 2005»
16 years 1 months ago
Network Load Games
We study network load games, a class of routing games in networks which generalize selfish routing games on networks consisting of parallel links. In these games, each user aims t...
Ioannis Caragiannis, Clemente Galdi, Christos Kakl...
COMPLEX
2009
Springer
15 years 11 months ago
Community Identification in Directed Networks
The most common approach to community identification of directed networks has been to ignore edge directions and apply methods developed for undirected networks. Recently, Leicht a...
Youngdo Kim, Seung-Woo Son, Hawoong Jeong