241 search results - page 17 / 49 » Fast heuristics for large scale covering-location problems |
PPAM
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. We consider the problem of computing a weighted edge matching in a large graph using a parallel algorithm. This problem has application in several areas of combinatorial ...
85
Voted
DASFAA
2009
IEEE
15 years 1 months ago
2009
IEEE
Graph-structured databases and related problems such as reachability query processing have been increasingly relevant to many applications such as XML databases, biological databas...
86
Voted
ASPDAC
2007
ACM
15 years 1 months ago
2007
ACM
- This paper proposes a fast and practical decoupling capacitor (decap) budgeting algorithm to optimize the power ground (P/G) network design. The new method adopts a modified rand...
BMCBI
2010
14 years 9 months ago
2010
Background: Improving the accuracy and efficiency of motif recognition is an important computational challenge that has application to detecting transcription factor binding sites...
IPPS
2000
IEEE
15 years 2 months ago
2000
IEEE
In order to show that the parallel co-evolution of di erent heuristic methods may lead to an e cient search strategy, we have hybridized three heuristic agents of complementary beh...