118 search results - page 12 / 24 » Using Local Trajectory Optimizers to Speed Up Global Optimiz... |
123
Voted
COREGRID
2007
Springer
15 years 9 months ago
2007
Springer
This paper deals with the replica placement problem on fully homogeneous tree networksknownasthe Replica Placementoptimizationproblem. Theclient requests are known beforehand, whil...
171
Voted
CVIU
2011
14 years 6 months ago
2011
Quadratic optimization lies at the very heart of many structural pattern recognition and computer vision problems, such as graph matching, object recognition, image segmentation, ...
119
click to vote
TASE
2008
IEEE
15 years 2 months ago
2008
IEEE
Concurrent engineering has been widely used in managing design projects to speed up the design process by concurrently performing multiple tasks. Since the progress of a design tas...
115
Voted
ICMCS
2005
IEEE
15 years 8 months ago
2005
IEEE
The existing techniques for shot partitioning either process each shot boundary independently or proceed sequentially. The sequential process assumes the last shot boundary is cor...
149
Voted
BIBE
2008
IEEE
15 years 9 months ago
2008
IEEE
— The Smith-Waterman algorithm is a dynamic programming method for determining optimal local alignments between nucleotide or protein sequences. However, it suffers from quadrati...