9405 search results - page 1126 / 1881 » Computing a Model of Set Theory |
179
Voted
EOR
2010
15 years 7 months ago
2010
In the Attractive Traveling Salesman Problem the vertex set is partitioned into facility vertices and customer vertices. A maximum profit tour must be constructed on a subset of t...
172
click to vote
ACL
2012
13 years 10 months ago
2012
Syntax-based translation models that operate on the output of a source-language parser have been shown to perform better if allowed to choose from a set of possible parses. In thi...
206
click to vote
ACL
2012
13 years 10 months ago
2012
We present a novel approach to the task of word lemmatisation. We formalise lemmatisation as a category tagging task, by describing how a word-to-lemma transformation rule can be ...
310
click to vote
ICALP
2009
Springer
16 years 7 months ago
2009
Springer
Correlation Clustering was defined by Bansal, Blum, and Chawla as the problem of clustering a set of elements based on a possibly inconsistent binary similarity function between e...
198
click to vote
GECCO
2007
Springer
16 years 1 months ago
2007
Springer
The application of resource-defined fitness sharing (RFS) to shape nesting problems reveals a remarkable ability to discover tilings [7, 8]. These tilings represent exact covers...