Sciweavers

451 search results - page 29 / 91
» Relationless Completeness and Separations
Sort
View
COR
2011
14 years 4 months ago
Time-constrained project scheduling with adjacent resources
We develop a decomposition method for the Time-Constrained Project Scheduling Problem (TCPSP) with Adjacent Resources. For adjacent resources the resource units are ordered and th...
Johann Hurink, A. L. Kok, Jacob Jan Paulus, J. M. ...
ACL
2011
14 years 1 months ago
A Cross-Lingual ILP Solution to Zero Anaphora Resolution
We present an ILP-based model of zero anaphora detection and resolution that builds on the joint determination of anaphoricity and coreference model proposed by Denis and Baldridg...
Ryu Iida, Massimo Poesio
DISOPT
2008
81views more  DISOPT 2008»
14 years 9 months ago
Intermediate integer programming representations using value disjunctions
We introduce a general technique to create an extended formulation of a mixed-integer program. We classify the integer variables into blocks, each of which generates a finite set ...
Matthias Köppe, Quentin Louveaux, Robert Weis...
POPL
2004
ACM
15 years 10 months ago
Principal typings for Java-like languages
The contribution of the paper is twofold. First, we define a general notion of type system equipped with an entailment relation between type environments; this generalisation serv...
Davide Ancona, Elena Zucca
105
Voted
ICQNM
2008
IEEE
201views Chemistry» more  ICQNM 2008»
15 years 4 months ago
Loss-Tolerant Quantum Coin Flipping
Coin flipping is a cryptographic primitive in which two spatially separated players, who in principle do not trust each other, wish to establish a common random bit. If we limit ...
Guido Berlín, Gilles Brassard, Félix...