Sciweavers

2996 search results - page 155 / 600
» Numberings and Randomness
Sort
View
153
Voted
DAM
2008
134views more  DAM 2008»
15 years 5 months ago
Efficient algorithms for finding critical subgraphs
This paper presents algorithms to find vertex-critical and edgecritical subgraphs in a given graph G, and demonstrates how these critical subgraphs can be used to determine the ch...
Christian Desrosiers, Philippe Galinier, Alain Her...
ESA
2011
Springer
260views Algorithms» more  ESA 2011»
14 years 5 months ago
On Variants of the Matroid Secretary Problem
We present a number of positive and negative results for variants of the matroid secretary problem. Most notably, we design a constant-factor competitive algorithm for the “rando...
Shayan Oveis Gharan, Jan Vondrák
WSC
2007
15 years 7 months ago
Feasibility study of variance reduction in the logistics composite model
The Logistics Composite Model (LCOM) is a stochastic, discrete-event simulation that relies on probabilities and random number generators to model scenarios in a maintenance unit ...
George P. Cole III, Alan W. Johnson, J. O. Miller
151
Voted
WCE
2007
15 years 6 months ago
On the Statistical Distribution of Stationary Segment Lengths of Road Vehicles Vibrations
— This paper presents an important outcome of a research programme which focuses on the development of a method for synthesizing, under controlled conditions in the laboratory, t...
Vincent Rouillard
137
Voted
ICST
2008
IEEE
15 years 12 months ago
Model-Based Tests for Access Control Policies
We present a model-based approach to testing access control requirements. By using combinatorial testing, we first automatically generate test cases from and without access contro...
Alexander Pretschner, Tejeddine Mouelhi, Yves Le T...