Results 11 to 20 of about 943,757 (267)
Testing the bounds of compassion in young children [PDF]
Abstract Extensive research shows that, under the right circumstances, children are highly prosocial. Less in known about their capacity for compassion. Across five experiments (N = 285), we aimed to capture the bounds of 4-5-year-old children’s compassionate behaviour.
James N. Kirby +6 more
openaire +6 more sources
Testing bounded arboricity [PDF]
In this article, we consider the problem of testing whether a graph has bounded arboricity. The class of graphs with bounded arboricity includes many important graph families (e.g., planar graphs and randomly generated preferential attachment graphs).
Talya Eden, Reut Levi, Dana Ron
openaire +4 more sources
Parameterizations of Test Cover with Bounded Test Sizes [PDF]
In the {\sc Test Cover} problem we are given a hypergraph $H=(V, \mathcal{E})$ with $|V|=n, |\mathcal{E}|=m$, and we assume that $\mathcal{E}$ is a test cover, i.e. for every pair of vertices $x_i, x_j$, there exists an edge $e \in \mathcal{E}$ such that $|{x_i,x_j}\cap e|=1$.
Robert Crowston +4 more
openaire +3 more sources
A polynomial lower bound for testing monotonicity [PDF]
22 ...
Aleksandrs Belovs, Eric Blais
openaire +4 more sources
Group Testing Algorithms: Bounds and Simulations [PDF]
We consider the problem of non-adaptive noiseless group testing of $N$ items of which $K$ are defective. We describe four detection algorithms: the COMP algorithm of Chan et al.; two new algorithms, DD and SCOMP, which require stronger evidence to declare an item defective; and an essentially optimal but computationally difficult algorithm called SSS ...
Matthew Aldridge +2 more
openaire +4 more sources
Development of Import-Based Exports in Turkey: The ARDL Approach
Turkey adopted an export-dependent growth strategy after the 1980 liberalization. In later years, with the impact of this strategy, Turkey's export structure and performance became a subject of investigation. Thus, when the export structure is evaluated,
Yaşar Turna
doaj +1 more source
Testing Expansion in Bounded-Degree Graphs [PDF]
We consider the problem oftesting expansion in bounded-degree graphs. We focus on the notion ofvertex expansion: an α-expander is a graphG= (V,E) in which every subsetU⊆Vof at most |V|/2 vertices has a neighbourhood of size at least α ⋅ |U|. Our main result is that one can distinguish good expanders from graphs that are far from being weak expanders in
Artur Czumaj, Christian Sohler
openaire +2 more sources
A Schedulability Test for Sporadic Task DM Scheduling Based on Density Upper Bound
Due to low runtime overhead and simple implementation of DM (Deadline Monotonic) scheduling, it is widely used in real-time systems. Aiming at the schedulability test problem of the sporadic task DM scheduling under uniprocessor, a density upper bound of
Hongbiao Liu +4 more
doaj +1 more source
Software assurance by bounded exhaustive testing [PDF]
The contribution of this paper is an experiment that shows the potential value of a combination of selective reverse engineering to formal specifications and bounded exhaustive testing to improve the assurance levels of complex software. A key problem is to scale up test input generation so that meaningful results can be obtained.
Kevin J. Sullivan +4 more
openaire +1 more source
Bounded Reordering in the Distributed Test Architecture [PDF]
In the distributed test architecture, the system under test (SUT) interacts with its environment at multiple physically distributed ports and the local testers at these ports do not synchronize their actions. This presents many challenges and, in particular, apparently incorrect behaviors can be the consequence of an erroneous assumption about the ...
Robert M. Hierons +2 more
openaire +2 more sources

