Sciweavers

577 search results - page 63 / 116
» New interval methods for constrained global optimization
Sort
View
ICIP
2007
IEEE
16 years 5 months ago
Automatic Parametrisation for an Image Completion Method Based on Markov Random Fields
Recently, a new exemplar-based method for image completion, texture synthesis and image inpainting was proposed which uses a discrete global optimization strategy based on Markov ...
Huy Tho Ho, Roland Göcke
CVPR
2010
IEEE
16 years 13 days 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
188views Optimization» more  GECCO 2006»
15 years 7 months ago
Dynamic multi-objective optimization with evolutionary algorithms: a forward-looking approach
This work describes a forward-looking approach for the solution of dynamic (time-changing) problems using evolutionary algorithms. The main idea of the proposed method is to combi...
Iason Hatzakis, David Wallace
COR
2007
143views more  COR 2007»
15 years 4 months ago
A memetic algorithm for channel assignment in wireless FDMA systems
A new problem encoding is devised for the minimum span frequency assignment problem in wireless communications networks which is compact and general. Using the new encoding, which...
Sung-Soo Kim, Alice E. Smith, Jong-Hyun Lee
ICCAD
2006
IEEE
112views Hardware» more  ICCAD 2006»
16 years 26 days ago
A new RLC buffer insertion algorithm
Most existing buffering algorithms neglect the impact of inductance on circuit performance, which causes large error in circuit analysis and optimization. Even for the approaches...
Zhanyuan Jiang, Shiyan Hu, Jiang Hu, Zhuo Li, Weip...