Sciweavers

489 search results - page 23 / 98
» Formulations and Reformulations in Integer Programming
Sort
View
DAM
2006
172views more  DAM 2006»
15 years 3 months ago
A Branch-and-Cut algorithm for graph coloring
In a previous work, we proposed a new integer programming formulation for the graph coloring problem which, to a certain extent, avoids symmetry. We studied the facet structure of...
Isabel Méndez-Díaz, Paula Zabala
ACL
2010
15 years 1 months ago
Global Learning of Focused Entailment Graphs
We propose a global algorithm for learning entailment relations between predicates. We define a graph structure over predicates that represents entailment relations as directed ed...
Jonathan Berant, Ido Dagan, Jacob Goldberger
ACL
2009
15 years 1 months ago
Recognizing Stances in Online Debates
This paper presents an unsupervised opinion analysis method for debate-side classification, i.e., recognizing which stance a person is taking in an online debate. In order to hand...
Swapna Somasundaran, Janyce Wiebe
IJMTM
2011
190views more  IJMTM 2011»
14 years 10 months ago
Exact and heuristic approaches for lot splitting and scheduling on identical parallel machines
: In this paper, we address a lot splitting and scheduling problem existent in a textile factory. The factory we study produces a set of products that are made of, or assembled fro...
Carina Pimentel, Filipe Pereira Alvelos, Antonio D...
ICML
2010
IEEE
15 years 4 months ago
Boosting Classifiers with Tightened L0-Relaxation Penalties
We propose a novel boosting algorithm which improves on current algorithms for weighted voting classification by striking a better balance between classification accuracy and the ...
Noam Goldberg, Jonathan Eckstein