Sciweavers

1603 search results - page 99 / 321
» Universal Confidence Sets for Solutions of Optimization Prob...
Sort
View
ICDE
2008
IEEE
129views Database» more  ICDE 2008»
16 years 7 months ago
Optimal Boolean Matrix Decomposition: Application to Role Engineering
Abstract-- A decomposition of a binary matrix into two matrices gives a set of basis vectors and their appropriate combination to form the original matrix. Such decomposition solut...
Haibing Lu, Jaideep Vaidya, Vijayalakshmi Atluri
SAC
2004
ACM
15 years 11 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
EOR
2010
178views more  EOR 2010»
15 years 6 months ago
Facility location problems in the plane based on reverse nearest neighbor queries
For a finite set of points S, the (monochromatic) Reverse Nearest Neighbor (RNN) rule associates with any query point q the subset of points in S that have q as its nearest neighb...
Sergio Cabello, José Miguel Díaz-B&a...
TSC
2010
159views more  TSC 2010»
15 years 1 months ago
A Mathematical Programming Approach for Server Consolidation Problems in Virtualized Data Centers
Today's data centers offer IT services mostly hosted on dedicated physical servers. Server virtualization provides a technical means for server consolidation. Thus, multiple v...
Benjamin Speitkamp, Martin Bichler
KDD
2007
ACM
249views Data Mining» more  KDD 2007»
16 years 6 months ago
The minimum consistent subset cover problem and its applications in data mining
In this paper, we introduce and study the Minimum Consistent Subset Cover (MCSC) problem. Given a finite ground set X and a constraint t, find the minimum number of consistent sub...
Byron J. Gao, Martin Ester, Jin-yi Cai, Oliver Sch...