1576 search results - page 23 / 316 » Properties of Synthetic Optimization Problems |
AI
2006
Springer
13 years 10 months ago
2006
Springer
Branch-and-bound and branch-and-cut use search trees to identify optimal solutions to combinatorial optimization problems. In this paper, we introduce an iterative search strategy...
TASE
2008
IEEE
13 years 9 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 ...
GECCO
2009
Springer
14 years 2 months ago
2009
Springer
High–dimensional optimization problems appear very often in demanding applications. Although evolutionary algorithms constitute a valuable tool for solving such problems, their ...
Publication
![Optimal Approximations by Piecewise Smooth Functions and Associated Variational Problems - [ Mumford-Shah ]](https://www.sciweavers.org/files/imagecache/thumbnail/imagecache/mumphord_shah.jpg "Optimal Approximations by Piecewise Smooth Functions and Associated Variational Problems - [ Mumford-Shah ]")
"The purpose of this paper is to introduce and study the most basic properties of three new variational problems which are suggested by applications to computer vision. In com...
CC
2004
Springer
14 years 3 months ago
2004
Springer
Although optimization technology has been successful over the past 40 years, recent trends are emerging that demand we reconsider the paradigm that we are using for code optimizati...