Sciweavers

3142 search results - page 46 / 629
» Solving Hierarchical Optimization Problems Using MOEAs
Sort
View
AMAI
2000
Springer
15 years 1 months ago
On Solving Boolean Optimization with Satisfiability-Based Algorithms
This paper proposes new algorithms for the Binate Covering Problem (BCP), a well-known restriction of Boolean Optimization. Binate Covering finds application in many areas of Comp...
Vasco M. Manquinho, João P. Marques Silva
NETWORKS
2002
14 years 9 months ago
Node-disjoint paths and related problems on hierarchical cubic networks
An n-dimensional hierarchical cubic network (denoted by HCN(n)) contains 2 n n-dimensional hypercubes. The diameter of the HCN(n), which is equal to n+(n+1)/3+1, is about two-thir...
Jung-Sheng Fu, Gen-Huey Chen, Dyi-Rong Duh
CVPR
2000
IEEE
15 years 11 months ago
A Curve Evolution Approach to Smoothing and Segmentation Using the Mumford-Shah Functional
In this work, we approach the classic Mumford-Shah problem from a curve evolution perspective. In particular, we let a given family of curves define the boundaries between regions...
Andy Tsai, Anthony J. Yezzi, Alan S. Willsky
EVOW
2010
Springer
15 years 2 months ago
Memory Design for Constrained Dynamic Optimization Problems
A proposal for a memory design is given that is suitable for solving constrained dynamic optimization problems by an evolutionary m. Based on ideas from abstract memory, two scheme...
Hendrik Richter
SIAMCO
2008
80views more  SIAMCO 2008»
14 years 9 months ago
Optimal Transportation Problem by Stochastic Optimal Control
We solve optimal transportation problem using stochastic optimal control theory. Indeed, for a super linear cost at most quadratic at infinity, we prove Kantorovich duality theore...
Toshio Mikami, Michèle Thieullen