6939 search results - page 519 / 1388 » Algorithm Engineering for Parallel Computation |
167
click to vote
SPAA
1998
ACM
15 years 8 months ago
1998
ACM
In this paper we develop models for and analyze several randomized work stealing algorithms in a dynamic setting. Our models represent the limiting behavior of systems as the numb...
157
click to vote
PPSN
2010
Springer
15 years 2 months ago
2010
Springer
This paper is concerned with a fixed-size population of autonomous agents facing unknown, possibly changing, environments. The motivation is to design an embodied evolutionary algo...
201
Voted
GCA
2009
15 years 2 months ago
2009
In this article a new algorithm for grid resource allocation based upon the theory of Algorithmic Mechanism Design (AMD) is presented. This algorithm is targeted at minimizing cost...
144
click to vote
ICCV
2009
IEEE
16 years 10 months ago
2009
IEEE
We present a system that can match and reconstruct 3D
scenes from extremely large collections of photographs such
as those found by searching for a given city (e.g., Rome) on
In...
145
click to vote
CSC
2008
15 years 6 months ago
2008
- The set-covering problem is an interesting problem in computational complexity theory. In [1], the setcovering problem has been proved to be NP hard and a greedy heuristic algori...