8431 search results - page 355 / 1687 » Algorithmically Independent Sequences |
148
click to vote
ACL
2001
15 years 8 months ago
2001
Previous research has shown that the plausibility of an adjective-noun combination is correlated with its corpus co-occurrence frequency. In this paper, we estimate the co-occurre...
170
click to vote
ISPE
2003
15 years 8 months ago
2003
: Work to date on computational models of negotiation has focused almost exclusively on defining agreements consisting of one or a few independent issues. The negotiation involved ...
176
click to vote
EUROPAR
2010
Springer
15 years 7 months ago
2010
Springer
Abstract. In this paper we consider the problem of scheduling on computing platforms composed of several independent organizations, known as the Multi-Organization Scheduling Probl...
180
click to vote
RSA
2002
15 years 6 months ago
2002
: Suppose that independent U 0 1 weights are assigned to the d 2 n2 edges of the complete d-partite graph with n vertices in each of the d = maximal independent sets. Then the expe...
174
click to vote
SWAT
1994
Springer
15 years 11 months ago
1994
Springer
Trapezoid graphs are a class of cocomparability graphs containing interval graphs and permutation graphs as subclasses. They were introduced by Dagan, Golumbic and Pinter DGP]. Th...