4451 search results - page 84 / 891 » On Random Ordering Constraints |
CAEPIA
2003
Springer
15 years 5 months ago
2003
Springer
Abstract. We propose two different methods for generating random orthogonal polygons with a given number of vertices. One is a polynomial time algorithm and it is supported by a t...
JAIR
2002
14 years 11 months ago
2002
The problem of organizing information for multidocument summarization so that the generated summary is coherent has received relatively little attention. While sentence ordering f...
RSA
1998
14 years 11 months ago
1998
Let Un,p be the random unary predicate and Tk the almost sure first-order theory of Un,p under the linear ordering, where k is a positive integer and n−1/k p(n) n−1/(k+1) . F...
RSA
2011
14 years 6 months ago
2011
An old problem of Erd˝os, Fajtlowicz and Staton asks for the order of a largest induced regular subgraph that can be found in every graph on n vertices. Motivated by this problem...
CADE
2007
Springer
16 years 5 days ago
2007
Springer
We present a method for proving rigid first order theorems by encoding them as propositional satisfiability problems. We encode the existence of a first order connection tableau an...