987 search results - page 139 / 198 » Asynchronous parallel search by the parallel genetic algorit... |
ASAP
2008
IEEE
14 years 3 months ago
2008
IEEE
RNA structure prediction, or folding, is a computeintensive task that lies at the core of several search applications in bioinformatics. We begin to address the need for high-thro...
WWW
2003
ACM
14 years 9 months ago
2003
ACM
In traditional peer-to-peer search networks, operations focus on properly labeled files such as music or video, and the actual search is often limited to text tags. The explosive ...
WSC
2008
13 years 11 months ago
2008
We present an improved sweep metaheuristic for discrete event simulation optimization. The sweep algorithm is a tree search similar to beam search. The basic idea is to run a limi...
ECCV
2010
Springer
14 years 2 months 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...
DCOSS
2006
Springer
14 years 23 days ago
2006
Springer
We consider in-network processing via local message passing. The considered setting involves a set of sensors each of which can communicate with a subset of other sensors. There is...