Sciweavers

4066 search results - page 459 / 814
» Almost Complete Sets
Sort
View
INFSOF
2006
151views more  INFSOF 2006»
15 years 7 months ago
Prioritized interaction testing for pair-wise coverage with seeding and constraints
Interaction testing is widely used in screening for faults. In software testing, it provides a natural mechanism for testing systems to be deployed on a variety of hardware and so...
Renée C. Bryce, Charles J. Colbourn
JALC
2006
133views more  JALC 2006»
15 years 7 months ago
Power and Efficiency of Minimal Parallelism in Polarizationless P Systems
Minimal parallelism was recently introduced [3] as a way of using the rules of a P system: from each set of applicable rules associated to a membrane, at least one rule must be ap...
Tseren-Onolt Ishdorj
JAPLL
2006
109views more  JAPLL 2006»
15 years 7 months ago
Deduction chains for common knowledge
Deduction chains represent a syntactic and in a certain sense constructive method for proving completeness of a formal system. Given a formula , the deduction chains of are built...
Mathis Kretz, Thomas Studer
JOC
2006
71views more  JOC 2006»
15 years 7 months ago
Private Computation: k-Connected versus 1-Connected Networks
We study the role of connectivity of communication networks in private computations under information theoretic settings. It will be shown that some functions can be computed by pr...
Markus Bläser, Andreas Jakoby, Maciej Liskiew...
ENTCS
2007
108views more  ENTCS 2007»
15 years 7 months ago
Remarks on Testing Probabilistic Processes
We develop a general testing scenario for probabilistic processes, giving rise to two theories: probabilistic may testing and probabilistic must testing. These are applied to a si...
Yuxin Deng, Rob J. van Glabbeek, Matthew Hennessy,...