Sciweavers

400 search results - page 33 / 80
» Extended formulations in combinatorial optimization
Sort
View
122
Voted
CEC
2009
IEEE
15 years 6 months ago
A multi-objective approach to Redundancy Allocation Problem in parallel-series systems
— The Redundancy Allocation Problem (RAP) is a kind of reliability optimization problems. It involves the selection of components with appropriate levels of redundancy or reliabi...
Zai Wang, Tianshi Chen, Ke Tang, Xin Yao
AIPS
2007
15 years 2 months ago
Robust Local Search and Its Application to Generating Robust Schedules
In this paper, we propose an extended local search framework to solve combinatorial optimization problems with data uncertainty. Our approach represents a major departure from sce...
Hoong Chuin Lau, Thomas Ou, Fei Xiao
ICIP
2006
IEEE
16 years 1 months ago
Robust Kernel-Based Tracking using Optimal Control
Although more efficient in computation compared to other tracking approaches such as particle filtering, the kernel-based tracking suffers from the "singularity" problem...
Wei Qu, Dan Schonfeld
SDM
2007
SIAM
143views Data Mining» more  SDM 2007»
15 years 1 months ago
Clustering by weighted cuts in directed graphs
In this paper we formulate spectral clustering in directed graphs as an optimization problem, the objective being a weighted cut in the directed graph. This objective extends seve...
Marina Meila, William Pentney
80
Voted
ICCV
2007
IEEE
16 years 1 months ago
Untangling Cycles for Contour Grouping
We introduce a novel topological formulation for contour grouping. Our grouping criterion, called untangling cycles, exploits the inherent topological 1D structure of salient cont...
Qihui Zhu, Gang Song, Jianbo Shi