7228 search results - page 544 / 1446 » From Algorithmic to Subjective Randomness |
165
click to vote
COLT
2007
Springer
16 years 1 months ago
2007
Springer
Abstract. We establish a generic theoretical tool to construct probabilistic bounds for algorithms where the output is a subset of objects from an initial pool of candidates (or mo...
142
click to vote
ISICA
2007
Springer
16 years 1 months ago
2007
Springer
Abstract. MOEA/D is a novel and successful Multi-Objective Evolutionary Algorithms(MOEA) which utilizes the idea of problem decomposition to tackle the complexity from multiple obj...
194
click to vote
NCA
2005
IEEE
16 years 16 days ago
2005
IEEE
Abstract— This paper describes an original approach to writing reactive algorithms on highly dynamic networks. We propose to use randomly mobile agents to gather global informati...
189
click to vote
EGC
2005
Springer
16 years 15 days ago
2005
Springer
The global internet is rich in commodity resources but scarce in specialized resources. We argue that a grid framework can achieve better performance if it separates the management...
143
click to vote
FCT
2005
Springer
16 years 15 days ago
2005
Springer
A partitioning of a set of n items is a grouping of these items into k disjoint, equally sized classes. Any partition can be modeled as a graph. The items become the vertices of th...