6437 search results - page 561 / 1288 » Parallel Algorithms for Arrangements |
194
click to vote
GECCO
2007
Springer
16 years 1 months ago
2007
Springer
In this paper we propose an agent-based model of evolutionary algorithms (EAs) which extends seamlessly from concurrent single-host to distributed multi-host installations. Since ...
213
click to vote
DSN
2003
IEEE
16 years 7 days ago
2003
IEEE
Our goal is to automatically obtain a distributed and fault-tolerant embedded system: distributed because the system must run on a distributed architecture; fault-tolerant because...
205
click to vote
ECCV
2010
Springer
16 years 4 days ago
2010
Springer
Abstract. PatchMatch is a fast algorithm for computing dense approximate nearest neighbor correspondences between patches of two image regions [1]. This paper generalizes PatchMatc...
184
click to vote
ICPP
2002
IEEE
15 years 12 months ago
2002
IEEE
In this paper, we present a MAC-Iayer packet scheduling algorithm called BPA, for real-time switched Ethernet networks. BPA considers a message model where trans-node application-...
172
click to vote
SAC
1998
ACM
15 years 11 months ago
1998
ACM
The fast messy genetic algorithm (fmGA) belongs to a class of algorithms inspired by the principles of evolution, known appropriately as "evolutionary algorithms" (EAs)....