1870 search results - page 54 / 374 » Abstract And-Parallel Machines |
SBIA
2000
Springer
15 years 5 months ago
2000
Springer
Abstract Classi
108
click to vote
ANOR
2008
15 years 2 months ago
2008
Abstract We consider the following scheduling setting: a set of
79
Voted
EOR
2002
15 years 2 months ago
2002
Abstract. We present fully polynomial approximation schemes for the problem of minimizing completion time variance of a set of n jobs on a single machine. The fastest of these sche...
108
click to vote
ICIRA
2009
Springer
15 years 1 days ago
2009
Springer
Abstract. Two algorithms for area coverage (for use in space applications) were evaluated using a simulator and then tested on a multi-robot society consisting of LEGO Mindstorms r...
146
click to vote
ISMM
2011
Springer
14 years 5 months ago
2011
Springer
Abstract. In this paper we present a parallel algorithm for the topological watershed, suitable for a shared memory parallel architecture. On a 24-core machine an average speed-up ...