Sciweavers

2465 search results - page 214 / 493
» Automata on Linear Orderings
Sort
View
EUSFLAT
2001
14 years 5 days ago
Refining aggregation operations in finite ordinal scales
We discuss how to aggregate multiple criteria evaluations belonging to qualitative, linearly ordered scales. Qualitative aggregation operations such as min or max can be refined b...
Didier Dubois, Henri Prade
PPAM
2007
Springer
14 years 4 months 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»
13 years 10 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
MP
2002
113views more  MP 2002»
13 years 10 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»
13 years 10 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