1310 search results - page 228 / 262 » A parallel genetic algorithm to solve the set-covering probl... |
SOFSEM
2000
Springer
15 years 1 months ago
2000
Springer
For half a century since computers came into existence, the goal of finding elegant and efficient algorithms to solve "simple" (welldefined and well-structured) problems ...
160
click to vote
SIGMOD
2007
ACM
15 years 9 months ago
2007
ACM
With the exponential growth of biological sequence databases, it has become critical to develop effective techniques for storing, querying, and analyzing these massive data. Suffi...
115
click to vote
VIS
2004
IEEE
15 years 11 months ago
2004
IEEE
We describe a general algorithm to produce compatible 3D triangulations from spatial decompositions. Such triangulations match edges and faces across spatial cell boundaries, solv...
ICPP
2002
IEEE
15 years 2 months ago
2002
IEEE
The development of correct synchronization code for distributed programs is a challenging task. In this paper, we propose an aspect oriented technique for developing synchronizati...
GECCO
2006
Springer
15 years 1 months ago
2006
Springer
The most popular approaches for reconstructing phylogenetic trees attempt to solve NP-hard optimization criteria such as maximum parsimony (MP). Currently, the bestperforming heur...