4377 search results - page 135 / 876 » Mass problems and randomness |
224
click to vote
IMCSIT
2010
15 years 3 months ago
2010
Recently we have setup the goal of investigating new truly distributed forms of Ant Colony Optimization. We proposed a new distributed approach for Ant Colony Optimization (ACO) al...
170
click to vote
ICCV
2009
IEEE
16 years 11 months ago
2009
IEEE
Random Forests (RFs) have become commonplace
in many computer vision applications. Their
popularity is mainly driven by their high computational
efficiency during both training ...
158
click to vote
STACS
2004
Springer
15 years 11 months ago
2004
Springer
We present an improved average case analysis of the maximum cardinality matching problem. We show that in a bipartite or general random graph on n vertices, with high probability ...
140
click to vote
SPDP
1991
IEEE
15 years 10 months ago
1991
IEEE
In this paper, we present a randomized algorithm for the multipacket (i.e., k − k) routing problem on an n × n mesh. The algorithm completes with high probability in at the mos...
176
click to vote
AISC
2008
Springer
15 years 8 months ago
2008
Springer
Grid computing offers a promising approach to solving challenging computational problems in an environment consisting of a large number of easily accessible resources. In this pape...