Sciweavers

206 search results - page 11 / 42
» Simplifying failure-inducing input
Sort
View
ESA
2005
Springer
123views Algorithms» more  ESA 2005»
14 years 1 months ago
Oblivious vs. Distribution-Based Sorting: An Experimental Evaluation
We compare two algorithms for sorting out-of-core data on a distributed-memory cluster. One algorithm, Csort, is a 3-pass oblivious algorithm. The other, Dsort, makes three passes...
Geeta Chaudhry, Thomas H. Cormen
TCAD
2008
96views more  TCAD 2008»
13 years 7 months ago
An Implicit Approach to Minimizing Range-Equivalent Circuits
Abstract--Simplifying a combinational circuit while preserving its range has a variety of applications, such as combinational equivalence checking and random simulation. Previous a...
Yung-Chih Chen, Chun-Yao Wang
UIST
1992
ACM
13 years 11 months ago
Tools for Building Asynchronous Servers to Support Speech and Audio Applications
Distributed clientisewer models are becoming increasingly prevalent in multimedia systems and advanced user interface design. A multimedia application, for example, may play and r...
Barry Arons
IPCO
2007
126views Optimization» more  IPCO 2007»
13 years 9 months ago
The Smoothed Number of Pareto Optimal Solutions in Bicriteria Integer Optimization
Abstract. A well established heuristic approach for solving various bicriteria optimization problems is to enumerate the set of Pareto optimal solutions, typically using some kind ...
René Beier, Heiko Röglin, Berthold V&o...
USENIX
2001
13 years 9 months ago
User-Level Extensibility in the Mona File System
A conventional file system provides the user with generic structure and semantics for accessing files. The default scheme is sufficient for many applications. However, many applic...
Paul W. Schermerhorn, Robert J. Minerick, Peter W....