130 search results - page 14 / 26 » Secretary Problems via Linear Programming |
105
click to vote
ICDM
2005
IEEE
15 years 5 months ago
2005
IEEE
We propose an algorithm to construct classification models with a mixture of kernels from labeled and unlabeled data. The derived classifier is a mixture of models, each based o...
IPPS
2003
IEEE
15 years 5 months ago
2003
IEEE
We propose general purposes natural heuristics for static block and block-cyclic heterogeneous data decomposition over processes of parallel program mapped into multidimensional g...
STOC
1999
ACM
15 years 4 months ago
1999
ACM
We propose the first combinatorial solution to one of the most classic problems in combinatorial optimization: the generalized minimum cost flow problem (flow with losses and g...
ATAL
2007
Springer
15 years 6 months ago
2007
Springer
Mixed Multi-Unit Combinatorial Auctions (MMUCAs) allow agents to bid for bundles of goods to buy, goods to sell, and transformations of goods. In particular, MMUCAs offer a high ...
106
click to vote
CORR
2010
Springer
14 years 12 months ago
2010
Springer
A well studied special case of bin packing is the 3-partition problem, where n items of size > 1 4 have to be packed in a minimum number of bins of capacity one. The famous Kar...