Sciweavers

1722 search results - page 306 / 345
» Generating Tests from Counterexamples
Sort
View
CORR
2010
Springer
162views Education» more  CORR 2010»
13 years 7 months ago
Random sampling of lattice paths with constraints, via transportation
We investigate Monte Carlo Markov Chain (MCMC) procedures for the random sampling of some one-dimensional lattice paths with constraints, for various constraints. We will see that...
Lucas Gerin
DM
2006
128views more  DM 2006»
13 years 7 months ago
Non-trivial t-designs without repeated blocks exist for all t
A computer package is being developed at Bayreuth for the generation and investigation of discrete structures. The package is a C and C++ class library of powerful algorithms endow...
Luc Teirlinck
TASE
2008
IEEE
13 years 7 months ago
Optimization of Joint Replacement Policies for Multipart Systems by a Rollout Framework
Maintaining an asset with life-limited parts, e.g., a jet engine or an electric generator, may be costly. Certain costs, e.g., setup cost, can be shared if some parts of the asset ...
Tao Sun, Qianchuan Zhao, Peter B. Luh, Robert N. T...
ASE
2005
137views more  ASE 2005»
13 years 7 months ago
Rewriting-Based Techniques for Runtime Verification
Techniques for efficiently evaluating future time Linear Temporal Logic (abbreviated LTL) formulae on finite execution traces are presented. While the standard models of LTL are i...
Grigore Rosu, Klaus Havelund
CCR
2005
76views more  CCR 2005»
13 years 7 months ago
Simplifying the synthesis of internet traffic matrices
A recent paper [8] presented methods for several steps along the road to synthesis of realistic traffic matrices. Such synthesis is needed because traffic matrices are a crucial i...
Matthew Roughan