نتایج جستجو برای: fine grained formations neogene

تعداد نتایج: 130310  

2008
ANDREAS GRÄVINGHOFF JÖRG KELLER

Fine-grained multithreading can be used to hide longlatency operations encountered in parallel computers during remote memory access. Instead of using special processor hardware, the emulation of fine-grained multithreading on standard processor hardware is investigated. While emulation of coarse-grained multithreading is common in modern operating systems, in the fine-grained case research on ...

2018
Arash Vahabzadeh Andrea Stocco Ali Mesbah

As a software system evolves, its test suite can accumulate redundancies over time. Test minimization aims at removing redundant test cases. However, current techniques remove whole test cases from the test suite using test adequacy criteria, such as code coverage. This has two limitations, namely (1) by removing a whole test case the corresponding test assertions are also lost, which can inhib...

1996
Claude Kirchner Christopher Lynch Christelle Scharff

We present a concurrent Completion procedure based on the use of a SOUR graph as data structure. The procedure has the following characteristics. It is asynchronous, there is no need for a global memory or global control, equations are stored in a SOUR graph with maximal structure sharing, and each vertex is a process, representing a term. Therefore, the parallelism is at the term level. Each e...

Journal: :IACR Cryptology ePrint Archive 2016
Akshay Degwekar Vinod Vaikuntanathan Prashant Nalini Vasudevan

Fine-grained cryptographic primitives are ones that are secure against adversaries with an apriori bounded polynomial amount of resources (time, space or parallel-time), where the honest algorithms use less resources than the adversaries they are designed to fool. Such primitives were previously studied in the context of time-bounded adversaries (Merkle, CACM 1978), space-bounded adversaries (C...

2006
Tobias Rho Günter Kniesel Malte Appeltauer

In theory, join points can be arbitrary places in the structure or execution of a program. However, most existing aspect languages do not support the full expressive power of this concept, limiting their pointcut languages to a subset of the theoretically possible join points. In this paper we explore a minimal language design based on only three built-in fine-grained pointcuts, which enable ex...

2001
John W. Byers Michael Luby Michael Mitzenmacher

Traditional approaches to receiver-driven layered multicast have advocated the benefits of cumulative layering, which can enable coarse-grained congestion control that complies with TCP-friendliness equations over large time scales. In this paper, we quantify the costs and benefits of using non-cumulative layering and present a new, scalable multicast congestion control scheme which provides a ...

Journal: :Physical Review Letters 2020

Journal: :ACM Transactions on Software Engineering and Methodology 2023

Fuzzing is a popular software testing method that discovers bugs by massively feeding target applications with automatically generated inputs. Many state-of-art fuzzers use branch coverage as feedback metric to guide the fuzzing process. The fuzzer retains inputs for further mutation only if increased. However, provides shallow sampling of program behaviours and hence may discard interesting mu...

2012
Sumithra Velupillai Maria Kvist

An important task in information access methods is distinguishing factual information from speculative or negated information. Fine-grained certainty levels of diagnostic statements in Swedish clinical text are annotated in a corpus from a medical university hospital. The annotation model has two polarities (positive and negative) and three certainty levels. However, there are many e-health sce...

Journal: :IEEE Transactions on Knowledge and Data Engineering 2020

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید