Results 1 - 10 of 1,640

A Fine-Grained Algorithm for Non-parametric Software Reliability Estimation

by unknown authors
"... In this article, we improve a non-parametric order statistics-based software reliability model by Barghout, Littlewood and Abdel-Ghaly (1998), from the standpoints of estimation algorithm and reliability measure. More specifically, we introduce the kernel density estimation method with a truncated G ..."
Abstract - Add to MetaCart
In this article, we improve a non-parametric order statistics-based software reliability model by Barghout, Littlewood and Abdel-Ghaly (1998), from the standpoints of estimation algorithm and reliability measure. More specifically, we introduce the kernel density estimation method with a truncated

Fine-Grain Dataflow Model And Algorithms For Visualization Systems

by Deyang Song , 1994
"... ... attribute grammar to specify attribute dependency and data transformation. Based on the fine-grain algorithms and the SDTM model, we have built a fine-grain visualization system that exhibits faster speed, less memory usage, and higher CPU utilization than a typical coarse-grain system. ..."
Abstract - Add to MetaCart
... attribute grammar to specify attribute dependency and data transformation. Based on the fine-grain algorithms and the SDTM model, we have built a fine-grain visualization system that exhibits faster speed, less memory usage, and higher CPU utilization than a typical coarse-grain system.

SPEA2: Improving the Strength Pareto Evolutionary Algorithm

by Eckart Zitzler, Marco Laumanns, Lothar Thiele , 2001
"... The Strength Pareto Evolutionary Algorithm (SPEA) (Zitzler and Thiele 1999) is a relatively recent technique for finding or approximating the Pareto-optimal set for multiobjective optimization problems. In different studies (Zitzler and Thiele 1999; Zitzler, Deb, and Thiele 2000) SPEA has shown very ..."
Abstract - Cited by 708 (19 self) - Add to MetaCart
, and Zamboglou 2001). In this paper, an improved version, namely SPEA2, is proposed, which incorporates in contrast to its predecessor a fine-grained fitness assignment strategy, a density estimation technique, and an enhanced archive truncation method. The comparison of SPEA2 with SPEA and two other modern

Fine-grain Dynamic Instruction Placement for L0 Scratch-Pad Memory

by Jongsoo Park, James Balfour, William J. Dally
"... We present a fine-grain dynamic instruction placement algorithm for small L0 scratch-pad memories (spms), whose unit of transfer can be an individual instruction. Our algorithm captures a large fraction of instruction reuse missed by coarse-grain placement algorithms whose unit of transfer is restri ..."
Abstract - Add to MetaCart
We present a fine-grain dynamic instruction placement algorithm for small L0 scratch-pad memories (spms), whose unit of transfer can be an individual instruction. Our algorithm captures a large fraction of instruction reuse missed by coarse-grain placement algorithms whose unit of transfer

Fine-Grained Crowdsourcing for Fine-Grained Recognition

by Jia Deng, Jonathan Krause, Li Fei-fei - In Computer Vision and Pattern Recognition (CVPR), 2013 IEEE Conference on , 2013
"... Fine-grained recognition concerns categorization at sub-ordinate levels, where the distinction between object classes is highly local. Compared to basic level recogni-tion, fine-grained categorization can be more challenging as there are in general less data and fewer discriminative features. This n ..."
Abstract - Cited by 38 (4 self) - Add to MetaCart
Fine-grained recognition concerns categorization at sub-ordinate levels, where the distinction between object classes is highly local. Compared to basic level recogni-tion, fine-grained categorization can be more challenging as there are in general less data and fewer discriminative features

Scheduling for reduced CPU energy

by Mark Weiser, Brent Welch, Alan Demers, Scott Shenker - USENIX SYMP. OPERATING , 1994
"... The energy usage of computer systems is becoming more important, especially for battery operated systems. Displays, disks, and cpus, in that order, use the most energy. Reducing the energy used by displays and disks has been studied elsewhere; this paper considers a new method for reducing the energ ..."
Abstract - Cited by 563 (2 self) - Add to MetaCart
the performance of these methods against workstation traces. The primary result is that by adjusting the clock speed at a fine grain, substantial CPU energy can be saved with a limited impact on performance.

Experience with Fine-Grain Synchronization in

by Mimd Machines For, Donald Yeung, Anant Agarwal - In The 4th Annual Symposium on Principles and Practice of Parallel Programming , 1993
"... This paper discusses our experience with fine-grain synchronization for a variant of the preconditioned conjugate gradient method. This algorithm represents a large class of algorithms that have been widely used but traditionally difficult to implement efficiently on vector and parallel machines. Th ..."
Abstract - Cited by 3 (0 self) - Add to MetaCart
This paper discusses our experience with fine-grain synchronization for a variant of the preconditioned conjugate gradient method. This algorithm represents a large class of algorithms that have been widely used but traditionally difficult to implement efficiently on vector and parallel machines

Modular fine-grained concurrency verification

by Viktor Vafeiadis
"... Traditionally, concurrent data structures are protected by a single mutual exclusion lock so that only one thread may access the data structure at any time. This coarse-grained approach makes it relatively easy to reason about correctness, but it severely limits parallelism. More advanced algorithms ..."
Abstract - Cited by 61 (7 self) - Add to MetaCart
that are modular (and hence scalable), easy for programmers to use, and yet powerful enough to verify complex algorithms. In doing so, it makes two theoretical and two practical contributions to reasoning about fine-grained concurrency. First, building on rely/guarantee reasoning and separation logic, it develops

Fine-grain partitioning in Codesign

by Peter Voigt Knudsen, Supervisors Jan Madsen, Robin Sharp , 1995
"... Cosynthesis is an emerging discipline in the area of high level system synthesis which aims at the development of automatic synthesis tools which do not only focus on individual parts of a system, but see the system as a whole and optimize the synthesis of the total system while considering the inte ..."
Abstract - Cited by 2 (2 self) - Add to MetaCart
the interaction between system components. This report focuses on codesign of the large range of systems that consist of a software component and a specialized hardware component connected by a communication channel. The specific task investigated is fine grain partitioning of an algorithm given by a data

An Optimal Coarse-grained Arc Consistency Algorithm

by Christian Bessiere, Roland H. C. Yap, Yuanlin Zhang - Artificial Intelligence
"... The use of constraint propagation is the main feature of any constraint solver. It is thus of prime importance to manage the propagation in an efficient and effec-tive fashion. There are two classes of propagation algorithms for general constraints: fine-grained algorithms where the removal of a val ..."
Abstract - Cited by 92 (16 self) - Add to MetaCart
The use of constraint propagation is the main feature of any constraint solver. It is thus of prime importance to manage the propagation in an efficient and effec-tive fashion. There are two classes of propagation algorithms for general constraints: fine-grained algorithms where the removal of a
Results 1 - 10 of 1,640