Sciweavers

8647 search results - page 79 / 1730
» The Container Selection Problem
Sort
View
COR
2010
123views more  COR 2010»
14 years 10 months ago
Multi-dimensional bin packing problems with guillotine constraints
The problem addressed in this paper is the decision problem of determining if a set of multi-dimensional rectangular boxes can be orthogonally packed into a rectangular bin while ...
Rasmus Resen Amossen, David Pisinger
IJCAI
2007
14 years 11 months ago
Optimistic Active-Learning Using Mutual Information
An “active learning system” will sequentially decide which unlabeled instance to label, with the goal of efficiently gathering the information necessary to produce a good cla...
Yuhong Guo, Russell Greiner
IJCNN
2006
IEEE
15 years 3 months ago
Semi-supervised feature selection via multiobjective optimization
Abstract— In previous work, we have shown that both unsupervised feature selection and the semi-supervised clustering problem can be usefully formulated as multiobjective optimiz...
Julia Handl, Joshua D. Knowles
MFCS
2005
Springer
15 years 3 months ago
Explicit Inapproximability Bounds for the Shortest Superstring Problem
Abstract. Given a set of strings S = {s1, . . . , sn}, the Shortest Superstring problem asks for the shortest string s which contains each si as a substring. We consider two measur...
Virginia Vassilevska
ALGORITHMICA
2010
141views more  ALGORITHMICA 2010»
14 years 10 months ago
Parameterized Complexity and Local Search Approaches for the Stable Marriage Problem with Ties
Abstract. We consider the variant of the classical Stable Marriage problem where preference lists can be incomplete and may contain ties. In such a setting, finding a stable matchi...
Dániel Marx, Ildikó Schlotter