29 papers:
DATE-2015-HuangKGT #scheduling- Run and be safe: mixed-criticality scheduling with temporary processor speedup (PH, PK, GG, LT), pp. 1329–1334.
ICML-2015-DingZSMM #consistency- Yinyang K-Means: A Drop-In Replacement of the Classic K-Means with Consistent Speedup (YD, YZ, XS, MM, TM), pp. 579–587.
- DATE-2014-LiSH0 #in memory #memory management #named
- Partial-SET: Write speedup of PCM main memory (BL, SS, YH, XL), pp. 1–4.
HPDC-2013-Shaw #named #simulation- Anton: a special-purpose machine that achieves a hundred-fold speedup in biomolecular simulations (DES), pp. 129–130.
ICLP-J-2013-ArbelaezTC #parallel #predict #runtime #satisfiability #using- Using sequential runtime distributions for the parallel speedup prediction of SAT local search (AA, CT, PC), pp. 625–639.
ASE-2012-GongLJZ #fault #locality- Diversity maximization speedup for fault localization (LG, DL, LJ, HZ), pp. 30–39.
- DATE-2012-QianTT #configuration management #self #using
- A flit-level speedup scheme for network-on-chips using self-reconfigurable bi-directional channels (ZQ, YFT, CYT), pp. 1295–1300.
CIKM-2012-LiuCBLR #graph #mining- Utilizing common substructures to speedup tensor factorization for mining dynamic graphs (WL, JC, JB, CL, KR), pp. 435–444.
OOPSLA-2011-JeonGLT #named #parallel #source code- Kismet: parallel speedup estimates for serial programs (DJ, SG, CML, MBT), pp. 519–536.
DLT-J-2007-BertoniR08 #approximate #monad- Approximating the Mean Speedup in Trace Monoids (AB, RR), pp. 497–511.
ICALP-A-2008-HallgrenH #quantum- Superpolynomial Speedups Based on Almost Any Quantum Circuit (SH, AWH), pp. 782–795.
- DLT-2007-BertoniR #monad
- Approximability and Non-approximability Results in Computing the Mean Speedup of Trace Monoids (AB, RR), pp. 72–83.
- DATE-2005-LyseckyV #case study #clustering #hardware #using
- A Study of the Speedups and Competitiveness of FPGA Soft Processor Cores using Dynamic Hardware/Software Partitioning (RLL, FV), pp. 18–23.
SAT-2005-LewisSB #satisfiability- Speedup Techniques Utilized in Modern SAT Solvers (MDTL, TS, BB), pp. 437–443.
- DATE-2003-SurendraBN #network #reuse
- Enhancing Speedup in Network Processing Applications by Exploiting Instruction Reuse with Flow Aggregation (GS, SB, SKN), pp. 10784–10789.
STOC-2003-ChildsCDFGS #algorithm #exponential #quantum- Exponential algorithmic speedup by a quantum walk (AMC, RC, ED, EF, SG, DAS), pp. 59–68.
SAC-2003-KimP #replication #using #xml #xquery- Xquery Speedup Using Replication in Mapping XML into Relations (JK, SP), pp. 536–543.
- ICML-1996-GordonS #learning #parametricity #statistics
- Nonparametric Statistical Methods for Experimental Evaluations of Speedup Learning (GJG, AMS), pp. 200–206.
- ICML-1996-ReddyTR #composition #empirical #learning
- Theory-guided Empirical Speedup Learning of Goal Decomposition Rules (CR, PT, SR), pp. 409–417.
- ICALP-1995-BodlaenderH #algorithm #bound #parallel
- Parallel Algorithms with Optimal Speedup for Bounded Treewidth (HLB, TH), pp. 268–279.
CSL-1993-GoerdtK #backtracking #on the #parallel- On the Reasons for Average Superlinear Speedup in Parallel Backtrack Search (AG, UK), pp. 106–127.
DAC-1992-Fishburn #heuristic #logic #named- LATTIS: An Iterative Speedup Heuristic for Mapped Logic (JPF), pp. 488–491.
PEPM-1992-AndersenG #analysis #partial evaluation- Speedup Analysis in Partial Evaluation: Preliminary Results (LOA, CKG), pp. 1–7.
AdaEurope-1992-Lundberg #ada #parallel #predict #source code- Predicting the Speedup of Parallel Ada Programs (LL), pp. 257–274.
- ML-1992-Etzioni #analysis #learning
- An Asymptotic Analysis of Speedup Learning (OE), pp. 129–136.
- ML-1992-Segre #multi #on the
- On Combining Multiple Speedup Techniques (AMS), pp. 400–405.
- CSL-1988-Speckenmeyer #question
- Is Average Superlinear Speedup Possible? (ES), pp. 301–312.
RTA-1987-RameshR #parallel #pattern matching- Optimal Speedups for Parallel Pattern Matching in Trees (RR, IVR), pp. 274–285.
- STOC-1983-DymondT #parallel
- Speedups of Deterministic Machines by Synchronous Parallel Machines (PWD, MT), pp. 336–343.
