Sciweavers

7758 search results - page 418 / 1552
» On the Number of Distributive Lattices
Sort
View
184
Voted
IOR
2006
75views more  IOR 2006»
15 years 6 months ago
Sensitivity of Performance in the Erlang-A Queueing Model to Changes in the Model Parameters
This paper studies the M/M/s+M queue, i.e., the M/M/s queue with customer abandonment, also called the Erlang-A model, having independent and identically distributed customer aban...
Ward Whitt
COMBINATORICS
2004
86views more  COMBINATORICS 2004»
15 years 6 months ago
Multiple Pattern Avoidance with respect to Fixed Points and Excedances
We study the distribution of the statistics `number of fixed points' and `number of excedances' in permutations avoiding subsets of patterns of length 3. We solve all th...
Sergi Elizalde
JAL
2002
69views more  JAL 2002»
15 years 6 months ago
Rates of convergence for Quicksort
The normalized number of key comparisons needed to sort a list of randomly permuted items by the Quicksort algorithm is known to converge in distribution. We identify the rate of ...
Ralph Neininger, Ludger Rüschendorf
180
Voted
PPSN
2010
Springer
15 years 5 months ago
Fixed Parameter Evolutionary Algorithms and Maximum Leaf Spanning Trees: A Matter of Mutation
Abstract. Evolutionary algorithms have been shown to be very successful for a wide range of NP-hard combinatorial optimization problems. We investigate the NP-hard problem of compu...
Stefan Kratsch, Per Kristian Lehre, Frank Neumann,...
199
Voted
IPPS
2010
IEEE
15 years 4 months ago
A general algorithm for detecting faults under the comparison diagnosis model
We develop a widely applicable algorithm to solve the fault diagnosis problem in certain distributed-memory multiprocessor systems in which there are a limited number of faulty pr...
Iain A. Stewart