9532 search results - page 383 / 1907 » Logic, Graphs, and Algorithms |
217
click to vote
GECCO
2009
Springer
15 years 4 months ago
2009
Springer
This paper describes a general scheme to convert sequential ant-based algorithms into parallel shared memory algorithms. The scheme is applied to an ant-based algorithm for the ma...
205
click to vote
FOCS
2008
IEEE
16 years 1 months ago
2008
IEEE
We present a technique for transforming classical approximation algorithms into constant-time algorithms that approximate the size of the optimal solution. Our technique is applic...
182
click to vote
PPAM
2007
Springer
16 years 27 days ago
2007
Springer
Abstract. We consider the problem of computing a weighted edge matching in a large graph using a parallel algorithm. This problem has application in several areas of combinatorial ...
165
click to vote
STOC
1990
ACM
15 years 10 months ago
1990
ACM
We present randomized algorithms for two sorting problems. In the local sorting problem, a graph is given in which each vertex is assigned an element of a total order, and the task...
197
click to vote
GECCO
2009
Springer
15 years 4 months ago
2009
Springer
This paper introduces a multiagent optimization algorithm inspired by the collective behavior of social insects. In our method, each agent encodes a possible solution of the probl...