Sciweavers

3145 search results - page 323 / 629
» Algebraic Linear Orderings
Sort
View
PPAM
2007
Springer
16 years 23 days ago
On Parallel Generation of Partial Derangements, Derangements and Permutations
The concept of a partial derangement is introduced and a versatile representation of partial derangements is proposed with permutations and derangements as special cases. The repre...
Zbigniew Kokosinski
IPM
2007
83views more  IPM 2007»
15 years 6 months ago
Information retrieval performance measures for a current awareness report composition aid
This papers studies a special “small” information retrieval problem where user satisfaction only depends on the ordering of documents. We look for a retrieval performance meas...
Thomas Krichel
177
Voted
MP
2002
113views more  MP 2002»
15 years 6 months ago
A note on sensitivity of value functions of mathematical programs with complementarity constraints
Using standard nonlinear programming (NLP) theory, we establish formulas for first and second order directional derivatives for optimal value functions of parametric mathematical ...
Xinmin Hu, Daniel Ralph
RSA
1998
59views more  RSA 1998»
15 years 6 months ago
Random unary predicates: Almost sure theories and countable models
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...
Joel Spencer, Katherine St. John
IPMU
2010
Springer
15 years 4 months ago
Rank Correlation Coefficient Correction by Removing Worst Cases
Abstract. Rank correlation can be used to compare two linearly ordered rankings. If the rankings include noise values, the rank correlation coefficient will yield lower values than...
Martin Krone, Frank Klawonn