Sciweavers

5754 search results - page 239 / 1151
» Multi-class Model M
Sort
View
RSA
2006
104views more  RSA 2006»
15 years 6 months ago
The satisfiability threshold for randomly generated binary constraint satisfaction problems
Abstract. We study two natural models of randomly generated constraint satisfaction problems. We determine how quickly the domain size must grow with n to ensure that these models ...
Alan M. Frieze, Michael Molloy
TRANSCI
2008
102views more  TRANSCI 2008»
15 years 6 months ago
Shunting of Passenger Train Units: An Integrated Approach
In this paper, we describe a new model for the Train Unit Shunting Problem. This model is capable of solving the matching and parking subproblems in an integrated manner, requirin...
Leo G. Kroon, Ramon M. Lentink, Alexander Schrijve...
ACL
2010
15 years 4 months ago
Unsupervised Event Coreference Resolution with Rich Linguistic Features
This paper examines how a new class of nonparametric Bayesian models can be effectively applied to an open-domain event coreference task. Designed with the purpose of clustering c...
Cosmin Adrian Bejan, Sanda M. Harabagiu
CP
2009
Springer
15 years 4 months ago
The Proper Treatment of Undefinedness in Constraint Languages
Any sufficiently complex finite-domain constraint modelling language has the ability to express undefined values, for example division by zero, or array index out of bounds. This p...
Alan M. Frisch, Peter J. Stuckey
SCP
2011
228views Communications» more  SCP 2011»
15 years 1 months ago
Dynamic consistency in process algebra: From Paradigm to ACP
The coordination modelling language Paradigm addresses collaboration between components in terms of dynamic constraints. Within a Paradigm model, component dynamics are consistent...
Suzana Andova, Luuk Groenewegen, Erik P. de Vink