Sciweavers

666 search results - page 78 / 134
» The Pipelined Set Cover Problem
Sort
View
CPAIOR
2005
Springer
14 years 3 months ago
Constraint Programming Based Column Generation for Employee Timetabling
The Employee Timetabling Problem (ETP) is a general class of problems widely encountered in service organizations (such as call centers for instance). Given a set of activities, a ...
Sophie Demassey, Gilles Pesant, Louis-Martin Rouss...
STOC
2010
ACM
224views Algorithms» more  STOC 2010»
14 years 2 months ago
Satisfiability Allows No Nontrivial Sparsification Unless The Polynomial-Time Hierarchy Collapses
Consider the following two-player communication process to decide a language L: The first player holds the entire input x but is polynomially bounded; the second player is computa...
Holger Dell and Dieter van Melkebeek
ILP
2003
Springer
14 years 3 months ago
Disjunctive Learning with a Soft-Clustering Method
In the case of concept learning from positive and negative examples, it is rarely possible to find a unique discriminating conjunctive rule; in most cases, a disjunctive descripti...
Guillaume Cleuziou, Lionel Martin, Christel Vrain
ICML
2008
IEEE
14 years 11 months ago
Predicting diverse subsets using structural SVMs
In many retrieval tasks, one important goal involves retrieving a diverse set of results (e.g., documents covering a wide range of topics for a search query). First of all, this r...
Yisong Yue, Thorsten Joachims
SDM
2009
SIAM
108views Data Mining» more  SDM 2009»
14 years 7 months ago
Highlighting Diverse Concepts in Documents.
We show the underpinnings of a method for summarizing documents: it ingests a document and automatically highlights a small set of sentences that are expected to cover the differ...
Evimaria Terzi, Kun Liu, Tyrone Grandison