982 search results - page 127 / 197 » Solving Steiner tree problems in graphs to optimality |
111
Voted
FPGA
1999
ACM
15 years 4 months ago
1999
ACM
Multi-FPGA systems are used as custom computing machines to solve compute intensive problems and also in the verification and prototyping of large circuits. In this paper, we addr...
110
click to vote
ICPR
2010
IEEE
15 years 5 months ago
2010
IEEE
In this paper we provide a framework of detection and localization of multiple similar shapes or object instances from an image based on shape matching. There are three challenges...
RECOMB
2005
Springer
16 years 27 days ago
2005
Springer
This paper proposes a novel tree decomposition based side-chain assignment algorithm, which can obtain the globally optimal solution of the side-chain packing problem very efficien...
102
Voted
HEURISTICS
2008
15 years 19 days ago
2008
Instruction scheduling is an important step for improving the performance of object code produced by a compiler. A fundamental problem that arises in instruction scheduling is to ...
148
click to vote
CPAIOR
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. We propose a hybrid approach for solving the resource-constrained project scheduling problem which is an extremely hard to solve combinatorial optimization problem of pra...