5580 search results - page 687 / 1116 » Randomized priority algorithms |
142
click to vote
SOCIALCOM
2010
15 years 2 months ago
2010
The huge size of online social networks (OSNs) makes it prohibitively expensive to precisely measure any properties which require the knowledge of the entire graph. To estimate the...
160
click to vote
ICCV
2009
IEEE
15 years 2 months ago
2009
IEEE
Finding the largest consensus set is one of the key ideas used by the original RANSAC for removing outliers in robust-estimation. However, because of its random and non-determinis...
133
click to vote
AISS
2010
15 years 1 months ago
2010
The vehicle routing problem consists in determining a group of optimal delivery routes that allow satisfaction of the demand from customers spread along a network, which can be re...
187
click to vote
IMCSIT
2010
15 years 1 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...
159
click to vote
CIAC
2010
Springer
15 years 1 months ago
2010
Springer
We study the parameterized complexity of the problems of determining whether a graph contains a k-edge subgraph (k-vertex induced subgraph) that is a -graph for -graphs being one ...