526 search results - page 93 / 106 » Generalized benchmark generation for dynamic combinatorial p... |
134
Voted
GECCO
2007
Springer
15 years 10 months ago
2007
Springer
Several theoretical analyses of the dynamics of particle swarms have been offered in the literature over the last decade. Virtually all rely on substantial simplifications, incl...
150
click to vote
VALUETOOLS
2006
ACM
15 years 9 months ago
2006
ACM
Min-max functions are dynamic programming operators of zero-sum deterministic games with finite state and action spaces. The problem of computing the linear growth rate of the or...
117
click to vote
WWW
2006
ACM
15 years 9 months ago
2006
ACM
We consider the problem of dust: Different URLs with Similar Text. Such duplicate URLs are prevalent in web sites, as web server software often uses aliases and redirections, and...
124
click to vote
ICDM
2003
IEEE
15 years 9 months ago
2003
IEEE
A data set can be clustered in many ways depending on the clustering algorithm employed, parameter settings used and other factors. Can multiple clusterings be combined so that th...
155
Voted
EUROPAR
2006
Springer
15 years 7 months ago
2006
Springer
Abstract. In this work we study the dynamic one-to-one communication problem in energy- and capacity-constrained wireless ad-hoc networks. The performance of such networks is evalu...