Pruning Unnecessary Computations using Improving Sequences
No abstract available.
Related papers
- Exponentially Expanding the Phase-Ordering Search Space via Dormant Information CC 2024
- Dataflow-based pruning for speeding up superoptimization OOPSLA 2020
- Transforming Query Sequences for High-Throughput B+ Tree Processing on Many-Core Processors CGO 2019
- On Failure of the Pruning Technique in "Error Repair in Shift-Reduce Parsers" TOPLAS 1999
- Dynamic N: M Fine-Grained Structured Sparse Attention Mechanism PPoPP 2023
- Multi-Stage Vertex-Centric Programming for Agent-Based Simulations GPCE 2023
- Fast searches for effective optimization phase sequences PLDI 2004
- Static Caching for Incremental Computation TOPLAS 1998