Sciweavers

3707 search results - page 139 / 742
» A Simple Technique for Self-Calibration
Sort
View
DM
2006
103views more  DM 2006»
14 years 10 months ago
Bounds on the forcing numbers of bipartite graphs
The forcing number of a perfect matching M of a graph G is the cardinality of the smallest subset of M that is contained in no other perfect matching of G. In this paper, we demon...
Seth Kleinerman
83
Voted
ENTCS
2006
119views more  ENTCS 2006»
14 years 10 months ago
Syntax-driven Behavior Partitioning for Model-checking of Esterel Programs
We consider the issue of exploiting the structural form of ESTEREL programs to partition the algorithmic RSS (reachable state space) fix-point construction used in model-checking t...
Eric Vecchié, Robert de Simone
73
Voted
IPL
2006
101views more  IPL 2006»
14 years 10 months ago
An efficient approximation for the Generalized Assignment Problem
We present a simple family of algorithms for solving the Generalized Assignment Problem (GAP). Our technique is based on a novel combinatorial translation of any algorithm for the...
Reuven Cohen, Liran Katzir, Danny Raz
TOPLAS
1998
52views more  TOPLAS 1998»
14 years 10 months ago
Within ARM's Reach: Compilation of Left-Linear Rewrite Systems via Minimal Rewrite Systems
A new compilation technique for left-linear term-rewriting systems is presented, where rewrite rules are transformed into so-called minimal rewrite rules. These minimal rules have...
Wan Fokkink, Jasper Kamperman, Pum Walters
HPCA
2009
IEEE
15 years 10 months ago
Feedback mechanisms for improving probabilistic memory prefetching
This paper presents three techniques for improving the effectiveness of the recently proposed Adaptive Stream Detection (ASD) prefetching mechanism. The ASD prefetcher is a standa...
Ibrahim Hur, Calvin Lin