16093 search results - page 124 / 3219 » On the optimality of the neighbor-joining algorithm |
106
click to vote
TASE
2008
IEEE
15 years 1 months ago
2008
IEEE
Dynamic programming, branch-and-bound, and constraint programming are the standard solution principles for nding optimal solutions to machine scheduling problems. We propose a new ...
ICPR
2000
IEEE
16 years 2 months ago
2000
IEEE
Most page segmentation algorithms have userspecifiable free parameters. However, algorithm designers typically do not provide a quantitative/rigorous method for choosing values fo...
130
click to vote
IRREGULAR
1995
Springer
15 years 5 months ago
1995
Springer
In this paper, we review parallel search techniques for approximating the global optimal solution of combinatorial optimization problems. Recent developments on parallel implementa...
94
Voted
IAJIT
2010
15 years 5 days ago
2010
: In this paper, we intend to study the synthesis of the multibeam arrays. The synthesis implementation’s method for this type of arrays permits to approach the appropriated radi...
122
click to vote
FSE
1997
Springer
15 years 5 months ago
1997
Springer
Most encryption algorithms are designed without regard to their performance on top-of-the-line microprocessors. This paper discusses general optimization principles algorithms desi...