8125 search results - page 1196 / 1625 » Parallelism and evolutionary algorithms |
175
click to vote
IPPS
2009
IEEE
16 years 1 months ago
2009
IEEE
—The performance of Particle Swarm Optimization (PSO) algorithms depends strongly upon the interaction among the particles. The existing communication topologies for PSO (e.g. st...
160
click to vote
DCOSS
2009
Springer
16 years 1 months ago
2009
Springer
We consider dual classes of geometric coverage problems, in which disks, corresponding to coverage regions of sensors, are used to cover a region or set of points in the plane. The...
186
click to vote
DCOSS
2009
Springer
16 years 1 months ago
2009
Springer
Sensor networks introduce new resource allocation problems in which sensors need to be assigned to the tasks they best help. Such problems have been previously studied in simplifi...
177
click to vote
JSSPP
2009
Springer
16 years 1 months ago
2009
Springer
In this paper, we examine the concept of giving every job a trial run before committing it to run until completion. Trial runs allow immediate job failures to be detected shortly a...
146
click to vote
JSSPP
2009
Springer
16 years 1 months ago
2009
Springer
Scheduling a task graph onto several processors is a trade-off between maximising concurrency and minimising interprocessor communication. A technique to reduce or avoid interproc...