8437 search results - page 524 / 1688 » Preferences over Sets |
159
click to vote
CORR
2004
Springer
15 years 6 months ago
2004
Springer
We describe a simple algorithm based on a Markov chain process to generate simply connected acyclic directed graphs over a fixed set of vertices. This algorithm is an extension of...
129
click to vote
COMBINATORICS
2002
15 years 6 months ago
2002
A sequence u = u1u2...un is said to be nonrepetitive if no two adjacent blocks of u are exactly the same. For instance, the sequence abcbcba contains a repetition bcbc, while abca...
149
click to vote
MLQ
2002
15 years 6 months ago
2002
In this paper it is shown that the intuitionistic fixed point theory ID i (strict) for times iterated fixed points of strictly positive operator forms is conservative for negativ...
151
click to vote
ORDER
2010
15 years 5 months ago
2010
We investigate the complexity of the lattice of local clones over a countably infinite base set. In particular, we prove that this lattice contains all algebraic lattices with at ...
200
click to vote
ACL
2009
15 years 4 months ago
2009
We developed caitra, a novel tool that aids human translators by (a) making suggestions for sentence completion in an interactive machine translation setting, (b) providing altern...