Sciweavers

774 search results - page 80 / 155
» Process Discovery Using Integer Linear Programming
Sort
View
SIAMJO
2008
97views more  SIAMJO 2008»
15 years 4 months ago
New Formulations for Optimization under Stochastic Dominance Constraints
Stochastic dominance constraints allow a decision-maker to manage risk in an optimization setting by requiring their decision to yield a random outcome which stochastically domina...
James Luedtke
ALGORITHMICA
1999
102views more  ALGORITHMICA 1999»
15 years 3 months ago
Approximating Latin Square Extensions
In this paper, we consider the following question: what is the maximum number of entries that can be added to a partially lled latin square? The decision version of this question ...
Ravi Kumar, Alexander Russell, Ravi Sundaram
ACL
2010
15 years 2 months ago
Automatic Generation of Story Highlights
In this paper we present a joint content selection and compression model for single-document summarization. The model operates over a phrase-based representation of the source doc...
Kristian Woodsend, Mirella Lapata
COR
2010
123views more  COR 2010»
15 years 4 months ago
Decomposition, reformulation, and diving in university course timetabling
In many real-life optimisation problems, there are multiple interacting components in a solution. For example, different components might specify assignments to different kinds of...
Edmund K. Burke, Jakub Marecek, Andrew J. Parkes, ...
ICDE
2008
IEEE
129views Database» more  ICDE 2008»
16 years 5 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