Sciweavers

1137 search results - page 150 / 228
» The GLOBAL optimization method revisited
Sort
View
CVPR
2010
IEEE
14 years 4 months ago
Parallel and Distributed Graph Cuts by Dual Decomposition
Graph cuts methods are at the core of many state-of-theart algorithms in computer vision due to their efficiency in computing globally optimal solutions. In this paper, we solve t...
Petter Strandmark, Fredrik Kahl
GECCO
2006
Springer
127views Optimization» more  GECCO 2006»
13 years 11 months ago
Multiobjective genetic algorithms for multiscaling excited state direct dynamics in photochemistry
This paper studies the effectiveness of multiobjective genetic and evolutionary algorithms in multiscaling excited state direct dynamics in photochemistry via rapid reparameteriza...
Kumara Sastry, D. D. Johnson, Alexis L. Thompson, ...
ASPDAC
2005
ACM
113views Hardware» more  ASPDAC 2005»
14 years 1 months ago
Scalable interprocedural register allocation for high level synthesis
Abstract— The success of classical high level synthesis has been limited by the complexity of the applications it can handle, typically not large enough to necessitate the depart...
Rami Beidas, Jianwen Zhu
BMCBI
2006
139views more  BMCBI 2006»
13 years 7 months ago
Improvement in accuracy of multiple sequence alignment using novel group-to-group sequence alignment algorithm with piecewise li
Background: Multiple sequence alignment (MSA) is a useful tool in bioinformatics. Although many MSA algorithms have been developed, there is still room for improvement in accuracy...
Shinsuke Yamada, Osamu Gotoh, Hayato Yamana
EWC
2010
178views more  EWC 2010»
13 years 5 months ago
Design of tensegrity structures using parametric analysis and stochastic search
Tensegrity structures are lightweight structures composed of cables in tension and struts in compression. Since tensegrity systems exhibit geometrically nonlinear behavior, findin...
Landolf Rhode-Barbarigos, Himanshu Jain, Prakash K...