1927 search results - page 51 / 386 » UMDAs for dynamic optimization problems |
95
Voted
ICCS
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. This paper reviews recent developments in our project that are focused on dynamic data-driven methods for efficient and reliable simulation based optimization, which may...
103
click to vote
WABI
2005
Springer
15 years 6 months ago
2005
Springer
Multiple Sequence Alignment (MSA) is one of the most fundamental problems in computational molecular biology. The running time of the best known scheme for finding an optimal ali...
117
click to vote
IJCSA
2007
15 years 15 days ago
2007
The problem of task assignment in heterogeneous computing systems has been studied for many years with many variations. We have developed a new hybrid approximation algorithm. The...
131
Voted
ICIP
2001
IEEE
16 years 2 months ago
2001
IEEE
A common problem in most active contour methods is that the recursive searching scheme can only return a local optimal solution. Furthermore, the internal energy of the snake is n...
117
click to vote
ECAI
2008
Springer
15 years 2 months ago
2008
Springer
We propose a new algorithm for solving Distributed Constraint Optimization Problems (DCOPs). Our algorithm, called DyBop, is based on branch and bound search with dynamic ordering ...