1550 search results - page 79 / 310 » Optimizing search by showing results in context |
GECCO
2007
Springer
14 years 3 months ago
2007
Springer
Dividing the set of nodes into clusters in the well-known traveling salesman problem results in the generalized traveling salesman problem which seeking a tour with minimum cost p...
ARTCOM
2009
IEEE
14 years 4 months ago
2009
IEEE
—This paper presents a Novel Bidirectional motion estimation technique, which is based on the Particle swarm optimization algorithm. Particle swarm optimization (PSO) is a popula...
ALMOB
2006
13 years 9 months ago
2006
The main goal of the motif finding problem is to detect novel, over-represented unknown signals in a set of sequences (e.g. transcription factor binding sites in a genome). The mo...
EDBT
2004
ACM
14 years 9 months ago
2004
ACM
The join operation, which combines tuples from multiple relations, is the most fundamental and, typically, the most expensive operation in database queries. The standard approach t...
DCC
2002
IEEE
14 years 8 months ago
2002
IEEE
We present a technique designed aiming to improve the compression of the Edgebreaker CLERS string for large and regular meshes, where regularity is understood as the compactness o...