377 search results - page 27 / 76 » A Fast Heuristic Algorithm for a Probe Mapping Problem |
SIGIR
2000
ACM
14 years 1 months ago
2000
ACM
The retrieval of stored images matching an input configuration is an important form of content-based retrieval. Exhaustive processing (i.e., retrieval of the best solutions) of co...
ECMDAFA
2010
Springer
14 years 14 hour ago
2010
Springer
Dynamic UML models like sequence diagrams (SD) lack sufficient formal semantics, making it difficult to build automated tools for their analysis, simulation and validation. A commo...
FCCM
2006
IEEE
14 years 2 months ago
2006
IEEE
FPGAs are becoming more and more attractive for high precision scientific computations. One of the main problems in efficient resource utilization is the quadratically growing r...
GPEM
2002
13 years 8 months ago
2002
Ant Colony Optimization (ACO) is a metaheuristic used to solve combinatorial optimization problems. As with other metaheuristics, like evolutionary methods, ACO algorithms often sh...
SAGA
2001
Springer
14 years 1 months ago
2001
Springer
We study the combinatorial optimization task of choosing the smoothest map from a given family of maps, which is motivated from motor control unit calibration. The problem is of a ...