Sciweavers

5329 search results - page 275 / 1066
» The Weighted Majority Algorithm
Sort
View
JNW
2006
88views more  JNW 2006»
15 years 6 months ago
A Genetic Algorithms Based Approach for Group Multicast Routing
Whereas multicast transmission in one-to-many communications allows the operator to drastically save network resources, it also makes the routing of the traffic flows more complex ...
Luca Sanna Randaccio, Luigi Atzori
JSAC
2011
126views more  JSAC 2011»
15 years 1 months ago
Spectrum Management in Multiuser Cognitive Wireless Networks: Optimality and Algorithm
Abstract— Spectrum management is used to improve performance in multiuser communication system, e.g., cognitive radio or femtocell networks, where multiuser interference can lead...
Chee Wei Tan, S. Friedland, Steven H. Low
ICANN
2009
Springer
16 years 1 months ago
Algorithms for Structural and Dynamical Polychronous Groups Detection
Polychronization has been proposed as a possible way to investigate the notion of cell assemblies and to understand their role as memory supports for information coding. In a spiki...
Régis Martinez, Hélène Paugam...
GECCO
2005
Springer
156views Optimization» more  GECCO 2005»
16 years 2 days ago
The blob code is competitive with edge-sets in genetic algorithms for the minimum routing cost spanning tree problem
Among the many codings of spanning trees for evolutionary search are those based on bijections between Pr¨ufer strings—strings of n−2 vertex labels—and spanning trees on th...
Bryant A. Julstrom
SIGMOD
2004
ACM
153views Database» more  SIGMOD 2004»
16 years 1 days ago
Spatially-decaying aggregation over a network: model and algorithms
Data items are often associated with a location in which they are present or collected, and their relevance or in uence decays with their distance. Aggregate values over such data...
Edith Cohen, Haim Kaplan