5153 search results - page 633 / 1031 » Introduction to Randomized Algorithms |
167
click to vote
VALUETOOLS
2006
ACM
15 years 11 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...
132
click to vote
GECCO
2005
Springer
15 years 10 months ago
2005
Springer
Evolutionary algorithms (EAs) are widely used to deal with optimization problems in dynamic environments (DE) [3]. When using EAs to solve DE problems, we are usually interested i...
124
click to vote
NOSSDAV
2004
Springer
15 years 10 months ago
2004
Springer
Quality of service for high-bandwidth or delay-sensitive applications in the Internet, such as streaming media and online games, can be significantly improved by replicating serv...
148
click to vote
INFOVIS
2003
IEEE
15 years 10 months ago
2003
IEEE
An algorithm is presented for the visualisation of multidimensional abstract data, building on a hybrid model introduced at InfoVis 2002. The most computationally complex stage of...
161
click to vote
WEA
2010
Springer
15 years 10 months ago
2010
Springer
Maximizing the quality index modularity has become one of the primary methods for identifying the clustering structure within a graph. As contemporary networks are not static but e...