Sciweavers

1563 search results - page 110 / 313
» Performance comparison of memetic algorithms
Sort
View
165
Voted
SPAA
1994
ACM
15 years 7 months ago
Bounds on the Greedy Routing Algorithm for Array Networks
We analyze the performance of greedy routing for array networks by providing bounds on the average delay and the average number of packets in the system for the dynamic routing pr...
Michael Mitzenmacher
134
Voted
MIA
2010
95views more  MIA 2010»
14 years 10 months ago
Evaluation of brain atrophy estimation algorithms using simulated ground-truth data
A number of analysis tools have been developed for the estimation of brain atrophy using MRI. Since brain atrophy is being increasingly used as a marker of disease progression in ...
Swati Sharma, Vincent Noblet, François Rous...
73
Voted
WWW
2005
ACM
16 years 4 months ago
Answering order-based queries over XML data
Order-based queries over XML data include XPath navigation axes such as following-sibling and following. In this paper, we present holistic algorithms that evaluate such order-bas...
Zografoula Vagena, Nick Koudas, Divesh Srivastava,...
GECCO
2006
Springer
156views Optimization» more  GECCO 2006»
15 years 7 months ago
A comparative study of evolutionary optimization techniques in dynamic environments
Genetic Algorithms have widely been used for solving optimization problems in stationary environments. In recent years, there has been a growing interest for investigating and imp...
Demet Ayvaz, Haluk Topcuoglu, Fikret S. Gürge...
CSDA
2008
122views more  CSDA 2008»
15 years 3 months ago
Time-adaptive quantile regression
An algorithm for time-adaptive quantile regression is presented. The algorithm is based on the simplex algorithm, and the linear optimization formulation of the quantile regressio...
Jan Kloppenborg Møller, Henrik Aalborg Niel...