Sciweavers

591 search results - page 55 / 119
» A constraint programming approach to cutset problems
Sort
View
INFOCOM
2009
IEEE
14 years 5 months ago
Towards Efficient Large-Scale VPN Monitoring and Diagnosis under Operational Constraints
Continuous monitoring and diagnosis of network performance are of crucial importance for the Internet access service and virtual private network (VPN) service providers. Various o...
Yao Zhao, Zhaosheng Zhu, Yan Chen, Dan Pei, Jia Wa...
CVPR
2005
IEEE
15 years 27 days ago
Robust L1 Norm Factorization in the Presence of Outliers and Missing Data by Alternative Convex Programming
Matrix factorization has many applications in computer vision. Singular Value Decomposition (SVD) is the standard algorithm for factorization. When there are outliers and missing ...
Qifa Ke, Takeo Kanade
SAC
2004
ACM
14 years 4 months ago
An improved hybrid genetic algorithm for the generalized assignment problem
We consider the generalized assignment problem in which the objective is to find a minimum cost assignment of a set of jobs to a set of agents subject to resource constraints. Th...
Harald Feltl, Günther R. Raidl
STOC
1995
ACM
145views Algorithms» more  STOC 1995»
14 years 2 months ago
Polynomial time approximation schemes for dense instances of NP-hard problems
We present a unified framework for designing polynomial time approximation schemes (PTASs) for “dense” instances of many NP-hard optimization problems, including maximum cut,...
Sanjeev Arora, David R. Karger, Marek Karpinski
COR
2010
155views more  COR 2010»
13 years 11 months ago
A memetic algorithm for the multi-compartment vehicle routing problem with stochastic demands
The Multi-Compartment Vehicle Routing Problem (MC-VRP) consists of designing transportation routes to satisfy the demands of a set of costumers for several products that because o...
Jorge E. Mendoza, Bruno Castanier, Christelle Gu&e...