Sciweavers

5153 search results - page 362 / 1031
» Introduction to Randomized Algorithms
Sort
View
WIOPT
2006
IEEE
15 years 10 months ago
Flow-level stability of channel-aware scheduling algorithms
— Channel-aware scheduling strategies provide an effective mechanism for improving the throughput performance in wireless data networks by exploiting channel fluctuations. The p...
Sem C. Borst, Matthieu Jonckheere
AUSAI
2005
Springer
15 years 10 months ago
Accelerating Real-Valued Genetic Algorithms Using Mutation-with-Momentum
: In a canonical genetic algorithm, the reproduction operators (crossover and mutation) are random in nature. The direction of the search carried out by the GA system is driven pur...
Luke Temby, Peter Vamplew, Adam Berry
156
Voted
GECCO
2005
Springer
156views Optimization» more  GECCO 2005»
15 years 10 months 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»
15 years 10 months 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
EGPGV
2004
Springer
165views Visualization» more  EGPGV 2004»
15 years 10 months ago
Tuning of Algorithms for Independent Task Placement in the Context of Demand-Driven Parallel Ray Tracing
This paper investigates assignment strategies (load balancing algorithms) for process farms which solve the problem of online placement of a constant number of independent tasks w...
Tomas Plachetka