Sciweavers

3136 search results - page 197 / 628
» Complex networks and evolutionary computation
Sort
View
GECCO
2007
Springer
195views Optimization» more  GECCO 2007»
15 years 11 months ago
MILCS: a mutual information learning classifier system
This paper introduces a new variety of learning classifier system (LCS), called MILCS, which utilizes mutual information as fitness feedback. Unlike most LCSs, MILCS is specifical...
Robert Elliott Smith, Max Kun Jiang
PRL
2011
14 years 12 months ago
Efficient approximate Regularized Least Squares by Toeplitz matrix
Machine Learning based on the Regularized Least Square (RLS) model requires one to solve a system of linear equations. Direct-solution methods exhibit predictable complexity and s...
Sergio Decherchi, Paolo Gastaldo, Rodolfo Zunino
ICN
2005
Springer
15 years 10 months ago
Discovery and Routing in the HEN Heterogeneous Peer-to-Peer Network
Network infrastructures are nowadays getting more and more complex as security considerations and technical needs like network address translation are blocking traffic and protocol...
Tim Schattkowsky
WICON
2008
15 years 6 months ago
A graph based routing algorithm for multi-hop cognitive radio networks
Cognitive radio networks that allow dynamic spectrum access are considered spectrally more efficient than networks using fixed spectral allocation. These networks are characterize...
Yogesh Reddy Kondareddy, Prathima Agrawal
MOBIHOC
2010
ACM
15 years 2 months ago
Greedy geographic routing in large-scale sensor networks: a minimum network decomposition approach
In geographic (or geometric) routing, messages are expected to route in a greedy manner: the current node always forwards a message to its neighbor node that is closest to the des...
Anne-Marie Kermarrec, Guang Tan