Stem exact$ (all stems)

167 papers:

DATE-2015-GorevUD #fault #parallel #simulation

Fault simulation with parallel exact critical path tracing in multiple core environment (MG, RU, SD), pp. 1180–1185.

SIGMOD-2015-JiangFW #keyword #network #scalability

Exact Top-k Nearest Keyword Search in Large Networks (MJ, AWCF, RCWW), pp. 393–404.

SANER-2015-OumarouAEDK #identification

Identifying the exact fixing actions of static rule violation (HO, NA, AE, SD, DTK), pp. 371–379.

CC-2015-DarteI #approximate #optimisation #parametricity

Exact and Approximated Data-Reuse Optimizations for Tiling with Parametric Sizes (AD, AI), pp. 151–170.

ASE-2014-GuoZORCAA #combinator #optimisation #parallel #scalability

Scaling exact multi-objective combinatorial optimization by parallelization (JG, EZ, RO, DR, KC, SA, JMA), pp. 409–420.

ASE-2014-LuckowPDFV #approximate #execution #nondeterminism #probability #source code #symbolic computation

Exact and approximate probabilistic symbolic execution for nondeterministic programs (KSL, CSP, MBD, AF, WV), pp. 575–586.

CASE-2014-GargSYPCHPAG #analysis #automation #reachability

Exact reachability analysis for planning skew-line needle arrangements for automated brachytherapy (AG, TS, GY, SP, JAMC, ICH, JP, AA, KYG), pp. 524–531.

DAC-2014-KeszoczeWHD #synthesis

Exact One-pass Synthesis of Digital Microfluidic Biochips (OK, RW, TYH, RD), p. 6.

DATE-2014-LeeserMRW #effectiveness #float #reasoning

Make it real: Effective floating-point reasoning via exact arithmetic (ML, SM, JR, TW), pp. 1–4.

PLDI-2014-Palem #question #what

What exactly is inexact computation good for? (KVP), p. 1.

ICML-c2-2014-WangWY #reduction #scalability

Scaling SVM and Least Absolute Deviations via Exact Data Reduction (JW, PW, JY), pp. 523–531.

KDIR-2014-AbouEisha

Finding Optimal Exact Reducts (HA), pp. 149–153.

KR-2014-KonevLOW #learning #lightweight #logic #ontology

Exact Learning of Lightweight Description Logic Ontologies (BK, CL, AO, FW).

LOPSTR-2014-Balaniuk #induction #synthesis

Drill and Join: A Method for Exact Inductive Program Synthesis (RB), pp. 219–237.

PPDP-2014-Ramsay #abstraction #recursion #safety

Exact Intersection Type Abstractions for Safety Checking of Recursion Schemes (SJR), pp. 175–186.

SPLC-2014-OlaecheaRGC #approximate #comparison #multi #optimisation #product line

Comparison of exact and approximate multi-objective optimization for software product lines (RO, DR, JG, KC), pp. 92–101.

SIGMOD-2013-AkibaIY #distance #network #performance #query #scalability

Fast exact shortest-path distance queries on large networks by pruned landmark labeling (TA, YI, YY), pp. 349–360.

TACAS-2013-BacciBLM #on the fly #similarity

On-the-Fly Exact Computation of Bisimilarity Distances (GB, GB, KGL, RM), pp. 1–15.

STOC-2013-Ambainis #algorithm #quantum

Superlinear advantage for exact quantum algorithms (AA), pp. 891–900.

STOC-2013-BravermanGPW #communication

From information to exact communication (MB, AG, DP, OW), pp. 151–160.

ICALP-v1-2013-AbboudL

Exact Weight Subgraphs and the k-Sum Conjecture (AA, KL), pp. 1–12.

ICALP-v1-2013-BringmannF #generative #geometry #graph #performance #random

Exact and Efficient Generation of Geometric Random Variates and Random Graphs (KB, TF), pp. 267–278.

ICML-c3-2013-MalioutovV #learning

Exact Rule Learning via Boolean Compressed Sensing (DMM, KRV), pp. 765–773.

ICML-c3-2013-WangK #algorithm #energy #performance

A Fast and Exact Energy Minimization Algorithm for Cycle MRFs (HW, DK), pp. 190–198.

KDD-2013-0001Z

Exact sparse recovery with L0 projections (PL, CHZ), pp. 302–310.

LICS-2013-Pattinson #logic

The Logic of Exact Covers: Completeness and Uniform Interpolation (DP), pp. 418–427.

TLCA-2013-Clairambault #bound #linear #reduction

Bounding Skeletons, Locally Scoped Terms and Exact Bounds for Linear Head Reduction (PC), pp. 109–124.

VLDB-2012-FujiwaraNOK #performance #random

Fast and Exact Top-k Search for Random Walk with Restart (YF, MN, MO, MK), pp. 442–453.

VLDB-2012-YangLW #database #named #sequence

ALAE: Accelerating Local Alignment with Affine Gap Exactly in Biosequence Databases (XY, HL, BW), pp. 1507–1518.

FLOPS-2012-TobitaTK #analysis #higher-order #model checking

Exact Flow Analysis by Higher-Order Model Checking (YT, TT, NK), pp. 275–289.

CIAA-2012-FaroL #algorithm #automaton #online #performance #string

A Fast Suffix Automata Based Algorithm for Exact Online String Matching (SF, TL), pp. 149–158.

ICML-2012-HoiWZ #learning

Exact Soft Confidence-Weighted Learning (SCHH, JW, PZ), p. 19.

ICML-2012-PeharzP #learning #network

Exact Maximum Margin Structure Learning of Bayesian Networks (RP, FP), p. 102.

KDD-2012-XiangZSY #rank

Optimal exact least squares rank minimization (SX, YZ, XS, JY), pp. 480–488.

QAPL-2012-Bernardo #bisimulation #concurrent #markov #process

Weak Markovian Bisimulation Congruences and Exact CTMC-Level Aggregations for Concurrent Processes (MB), pp. 122–136.

QAPL-2012-Giro #model checking #performance

Efficient computation of exact solutions for quantitative model checking (SG), pp. 17–32.

DAC-2011-HuangY #algorithm

An exact algorithm for the construction of rectilinear Steiner minimum trees among complex obstacles (TH, EFYY), pp. 164–169.

SIGMOD-2011-QinWLXL #performance #query #similarity #symmetry

Efficient exact edit similarity query processing with the asymmetric signature scheme (JQ, WW, YL, CX, XL), pp. 1033–1044.

SIGMOD-2011-YuKKHH

Exact indexing for support vector machines (HY, IK, YK, SwH, WSH), pp. 709–720.

VLDB-2012-QumsiyehPN11 #generative

Generating Exact- and Ranked Partially-Matched Answers to Questions in Advertisements (RQ, MSP, YKN), pp. 217–228.

STOC-2011-HansenKLMT #algorithm #game studies #probability

Exact algorithms for solving stochastic games: extended abstract (KAH, MK, NL, PBM, EPT), pp. 205–214.

ICALP-v1-2011-HarkinsH #algorithm #bound #game studies #learning

Exact Learning Algorithms, Betting Games, and Circuit Lower Bounds (RCH, JMH), pp. 416–423.

DUXU-v2-2011-Hofman #modelling #statistics

Range Statistics and the Exact Modeling of Discrete Non-Gaussian Distributions on Learnability Data (RH), pp. 421–430.

ICEIS-v4-2011-QiWGS #equation

Exact Solutions for the Complex Ginzburg-Landau Equation (PQ, DW, CG, HS), pp. 675–677.

SAC-2011-WangJZO #database #graph #keyword

Exact top-k keyword search on graph databases (MW, LJ, LZ, TO), pp. 985–986.

CSL-2011-SchnablS #complexity #runtime

The Exact Hardness of Deciding Derivational and Runtime Complexity (AS, JGS), pp. 481–495.

CASE-2010-XuSY #algorithm #problem

Exact algorithms for non-overlapping 2-frame problem with non-partial coverage for networked robotic cameras (YX, DS, JY), pp. 503–508.

DAC-2010-Breuer #bound #hardware

Hardware that produces bounded rather than exact results (MAB), pp. 871–876.

DATE-2010-LuckenbillLHMH #algorithm #analysis #fault #logic #named #reliability

RALF: Reliability Analysis for Logic Faults — An exact algorithm and its applications (SBL, JYL, YH, RM, LH), pp. 783–788.

LATA-2010-MarschallR #algorithm #analysis #automaton #pattern matching #probability

Exact Analysis of Horspool’s and Sunday’s Pattern Matching Algorithms with Probabilistic Arithmetic Automata (TM, SR), pp. 439–450.

CSL-2010-BlassDG #algorithm

Exact Exploration and Hanging Algorithms (AB, ND, YG), pp. 140–154.

LICS-2010-DanosFFHK #automation #difference #modelling #reduction #rule-based #semantics

Abstracting the Differential Semantics of Rule-Based Models: Exact and Automated Model Reduction (VD, JF, WF, RH, JK), pp. 362–381.

SAT-2010-LiMQZ #satisfiability

Exact MinSAT Solving (CML, FM, ZQ, ZZ), pp. 363–368.

SAT-2010-MakinoTY #algorithm #problem

An Exact Algorithm for the Boolean Connectivity Problem for k-CNF (KM, ST, MY), pp. 172–180.

SAT-2010-Paturi #algorithm #complexity

Exact Algorithms and Complexity (RP), pp. 8–9.

VLDB-2009-ChaudhuriNR #optimisation #query #testing

Exact Cardinality Query Optimization for Optimizer Testing (SC, VRN, RR), pp. 994–1005.

STOC-2009-Sellie #learning #random

Exact learning of random DNF over the uniform distribution (LS), pp. 45–54.

ICALP-v1-2009-CyganP #approximate

Exact and Approximate Bandwidth (MC, MP), pp. 304–315.

CIKM-2009-TangSB #string

Space-economical partial gram indices for exact substring matching (NT, LS, PAB), pp. 285–294.

SAC-2009-LimaH #approach #using

Computing data cubes using exact sub-graph matching: the sequential MCG approach (JdCL, CMH), pp. 1541–1548.

CAV-2009-Monniaux #float #linear #on the #using

On Using Floating-Point Computations to Help an Exact Linear Arithmetic Decision Procedure (DM), pp. 570–583.

CSL-2009-Berger #induction #proving

From Coinductive Proofs to Exact Real Arithmetic (UB), pp. 132–146.

CASE-2008-TanakaF #algorithm #performance #scheduling

An efficient exact algorithm for general single-machine scheduling with machine idle time (ST, SF), pp. 371–376.

DATE-2008-HashemiG #algorithm #approximate #pipes and filters #synthesis

Exact and Approximate Task Assignment Algorithms for Pipelined Software Synthesis (MH, SG), pp. 746–751.

SIGMOD-2008-GouC #algorithm #graph #pattern matching #performance

Efficient algorithms for exact ranked twig-pattern matching over graphs (GG, RC), pp. 581–594.

FLOPS-2008-Julien #induction #integer #using

Certified Exact Real Arithmetic Using Co-induction in Arbitrary Integer Base (NJ), pp. 48–63.

ICML-2008-DugasG

Pointwise exact bootstrap distributions of cost curves (CD, DG), pp. 280–287.

ICML-2008-FinleyJ

Training structural SVMs when exact inference is intractable (TF, TJ), pp. 304–311.

ICML-2008-FrancLM #fault

Stopping conditions for exact computation of leave-one-out error in support vector machines (VF, PL, KRM), pp. 328–335.

ICPR-2008-ChinGT #2d #detection #image

Exact integral images at generic angles for 2D barcode detection (TJC, HG, NMT), pp. 1–4.

KDD-2008-FujiwaraSY #identification #markov #modelling #named #performance

SPIRAL: efficient and exact model identification for hidden Markov models (YF, YS, MY), pp. 247–255.

SAC-2008-TarauL #synthesis

Revisiting exact combinational circuit synthesis (PT, BL), pp. 1758–1759.

SAT-2008-FaureNOR #formal method #linear #satisfiability

SAT Modulo the Theory of Linear Arithmetic: Exact, Inexact and Commercial Solvers (GF, RN, AO, ERC), pp. 77–90.

SAT-2008-PorschenS #linear

A CNF Class Generalizing Exact Linear Formulas (SP, ES), pp. 231–245.

DAC-2007-TaylorP #combinator #design #logic #optimisation #physics

Exact Combinatorial Optimization Methods for Physical Design of Regular Logic Bricks (BT, LTP), pp. 344–349.

SIGIR-2007-ZhangX #estimation #modelling #performance

Fast exact maximum likelihood estimation for mixture of language models (YZ, WX), pp. 865–866.

CASE-2006-LopatinY #algorithm #approximate #polynomial #using

Using the forward search and the polynomial approximation algorithms in the exact algorithm for manipulator’s control in an unknown environment (PKL, ASY), pp. 206–211.

VLDB-2006-ArasuGK #performance

Efficient Exact Set-Similarity Joins (AA, VG, RK), pp. 918–929.

VLDB-2006-KeoghWXLV #distance #metric

LB_Keogh Supports Exact Indexing of Shapes under Rotation Invariance with Arbitrary Representations and Distance Measures (EJK, LW, XX, SHL, MV), pp. 882–893.

ICALP-v1-2006-BjorklundH #algorithm #satisfiability

Exact Algorithms for Exact Satisfiability and Number of Perfect Matchings (AB, TH), pp. 548–559.

FM-2006-DonaldsonM #approximate #model checking #reduction #symmetry

Exact and Approximate Strategies for Symmetry Reduction in Model Checking (AFD, AM), pp. 541–556.

ICPR-v1-2006-MillerH #visual notation

Exact View-Dependent Visual Hulls (GM, AH), pp. 107–111.

ICPR-v2-2006-SerratosaS #distance

Vision-Based Robot Positioning by an Exact Distance Between Hi (FS, AS), pp. 849–852.

QAPL-2006-BinderH06a #bytecode #profiling #using #virtual machine

Exact and Portable Profiling for the JVM Using Bytecode Instruction Counting (WB, JH), pp. 45–64.

DAC-2005-SuC #algorithm

An exact jumper insertion algorithm for antenna effect avoidance/fixing (BYS, YWC), pp. 325–328.

DATE-2005-KumarTCJ #fault

Implicit and Exact Path Delay Fault Grading in Sequential Circuits (MMVK, ST, SC, RJ), pp. 990–995.

DATE-2005-WangM #approximate #modelling

EM Wave Coupling Noise Modeling Based on Chebyshev Approximation and Exact Moment Formulation (BW, PM), pp. 976–981.

DATE-2005-YangHSP #logic #multi #quantum #synthesis #using

Exact Synthesis of 3-Qubit Quantum Circuits from Non-Binary Quantum Gates Using Multiple-Valued Logic and Group Theory (GY, WNNH, XS, MAP), pp. 434–435.

DocEng-2005-Beaudoux #documentation #interactive #xml

XML active transformation (eXAcT): transforming documents within interactive systems (OB), pp. 146–148.

CIKM-2005-HalachevST #sequence #using

Exact match search in sequence data using suffix trees (MH, NS, AT), pp. 123–130.

SIGIR-2005-Chai #empirical

Expectation of f-measures: tractable exact computation and some empirical observations of its properties (KMAC), pp. 593–594.

SAT-2005-AlsinetMP #satisfiability

Improved Exact Solvers for Weighted Max-SAT (TA, FM, JP), pp. 371–377.

SAT-2005-SangBK #heuristic #performance

Heuristics for Fast Exact Model Counting (TS, PB, HAK), pp. 226–240.

SAT-2005-Wahlstrom #performance #satisfiability

Faster Exact Solving of SAT Formulae with a Low Number of Occurrences per Variable (MW), pp. 309–323.

DAC-2004-TanGQ #analysis #approach #scalability

Hierarchical approach to exact symbolic analysis of large analog circuits (SXDT, WG, ZQ), pp. 860–863.

DATE-v1-2004-RamaniAMS #graph #independence #symmetry

Breaking Instance-Independent Symmetries in Exact Graph Coloring (AR, FAA, ILM, KAS), pp. 324–331.

ITiCSE-WGR-2004-MatosG #approximate #dependence #functional

SQL-based discovery of exact and approximate functional dependencies (VM, BG), pp. 58–63.

ICALP-2004-FominKT #algorithm #exponential

Exact (Exponential) Algorithms for Treewidth and Minimum Fill-In (FVF, DK, IT), pp. 568–580.

ICPR-v3-2004-SchoutenB #distance #performance

Fast Exact Euclidean Distance (FEED) Transformation (TES, ELvdB), pp. 594–597.

PPDP-2004-CarlierW #type inference

Type inference with expansion variables and intersection types in system E and an exact correspondence with β-reduction (SC, JBW), pp. 132–143.

LICS-2004-Marcial-RomeroE #semantics

Semantics of a Sequential Language for Exact Real-Number Computation (JRMR, MHE), pp. 426–435.

DATE-2003-EbendtGD #bound

Combination of Lower Bounds in Exact BDD Minimization (RE, WG, RD), pp. 10758–10763.

DATE-2003-LogothetisS #analysis #source code

Exact High Level WCET Analysis of Synchronous Programs by Symbolic State Space Exploration (GL, KS), pp. 10196–10203.

SIGMOD-2003-Amer-YahiaFSX #approximate #named #xml

PIX: Exact and Approximate Phrase Matching in XML (SAY, MFF, DS, YX), p. 664.

DATE-2002-PadmanabanT #fault #multi

Exact Grading of Multiple Path Delay Faults (SP, ST), pp. 84–88.

VLDB-2002-Keogh

Exact Indexing of Dynamic Time Warping (EJK), pp. 406–417.

VLDB-2002-ShegalovWBL #middleware #named

EOS: Exactly-Once E-Service Middleware (GS, GW, RSB, DBL), pp. 1043–1046.

STOC-2002-HellersteinR #learning #using

Exact learning of DNF formulas using DNF hypotheses (LH, VR), pp. 465–473.

ICALP-2002-BauerES #functional #paradigm

Comparing Functional Paradigms for Exact Real-Number Computation (AB, MHE, AKS), pp. 488–500.

ECIR-2002-Sormunen #evaluation #interactive #performance #query

A Retrospective Evaluation Method for Exact-Match and Best-Match Queries Applying an Interactive Query Performance Analyser (ES), pp. 334–352.

ICML-2002-DashC #classification #naive bayes

Exact model averaging with naive Bayesian classifiers (DD, GFC), pp. 91–98.

SAT-2002-Bruni #satisfiability

Exact selection of minimal unsatisfiable subformulae for special classes of propositional formulae (RB), p. 22.

DATE-2001-QuasemG #fault #simulation

Exact fault simulation for systems on Silicon that protects each core’s intellectual property (MSQ, SKG), p. 804.

PLDI-2001-ChatterjeePHL #analysis #behaviour

Exact Analysis of the Cache Behavior of Nested Loops (SC, EP, PJH, ARL), pp. 286–297.

LOPSTR-2001-FerrariFO #bound #logic #proving

Extracting Exact Time Bounds from Logical Proofs (MF, CF, MO), pp. 245–266.

STOC-2000-Fortune #integer #matrix #symmetry

Exact computations of the inertia symmetric integer matrices (SF), pp. 556–564.

ICPR-v3-2000-JacobBU

Exact Computation of Area Moments for Spline and Wavelet Curves (MJ, TB, MU), pp. 3131–3134.

DAC-1999-BeniniMMOP #algorithm #approximate #component #kernel #optimisation

Kernel-Based Power Optimization of RTL Components: Exact and Approximate Extraction Algorithms (LB, GDM, EM, GO, MP), pp. 247–252.

DAC-1999-ZhaoM #array #estimation #memory management

Exact Memory Size Estimation for Array Computations without Loop Unrolling (YZ, SM), pp. 811–816.

PODS-1999-BenediktL #approximate #constraints #query

Exact and Approximate Aggregation in Constraint Query (MB, LL), pp. 102–113.

ICALP-1999-EdalatK #integration

Numerical Integration with Exact Real Arithmetic (AE, MK), pp. 90–104.

ICML-1999-ParekhH #automaton

Simple DFA are Polynomially Probably Exactly Learnable from Simple Examples (RP, VH), pp. 298–306.

KDD-1999-PellegM #algorithm #geometry #reasoning

Accelerating Exact k-means Algorithms with Geometric Reasoning (DP, AWM), pp. 277–281.

DAC-1998-DrechslerDG #performance

Fast Exact Minimization of BDDs (RD, ND, WG), pp. 200–205.

DAC-1998-KorupoluLW #independence #logic

Exact Tree-based FPGA Technology Mapping for Logic Blocks with Independent LUTs (MRK, KKL, DFW), pp. 708–711.

DAC-1998-LiuPS #modelling #named #order

ftd: An Exact Frequency to Time Domain Conversion for Reduced Order RLC Interconnect Models (YL, LTP, AJS), pp. 469–472.

DATE-1998-JiangC #approximate #estimation

Exact and Approximate Estimation for Maximum Instantaneous Current of CMOS Circuits (YMJ, KTC), pp. 698–702.

DATE-1998-RuttenBEK #algorithm #divide and conquer #logic #performance

An Efficient Divide and Conquer Algorithm for Exact Hazard Free Logic Minimization (JWJMR, MRCMB, CAJvE, MAJK), pp. 749–754.

FoSSaCS-1998-Heckmann #integer #linear

The Appearance of Big Integers in Exact Real Arithmetic Based on Linear Fractional Transformations (RH), pp. 172–188.

STOC-1998-Huber #approximate

Exact Sampling and Approximate Counting Techniques (MH), pp. 31–40.

ICFP-1998-EdalatPS #lazy evaluation

Lazy Computation with Exact Real Numbers (AE, PJP, PS), pp. 185–194.

SAC-1998-RobbinsR #animation #information management #using #visualisation

Web-based dynamic information visualization using exact-time animation (KAR, SR), pp. 744–751.

LICS-1998-BirkedalCRS #category theory #type system

Type Theory via Exact Categories (LB, AC, GR, DSS), pp. 188–198.

DAC-1997-Coudert #graph

Exact Coloring of Real-Life Graphs is Easy (OC), pp. 121–126.

DAC-1997-KukimotoB #analysis #detection

Exact Required Time Analysis via False Path Detection (YK, RKB), pp. 220–225.

SAS-1997-Mossin #analysis

Exact Flow Analysis (CM), pp. 250–264.

ICALP-1997-BeaudryLT #finite

Finite Loops Recognize Exactly the Regular Open Languages (MB, FL, DT), pp. 110–120.

ICALP-1997-HemaspaandraHR #analysis #parallel

Exact Analysis of Dodgson Elections: Lewis Carroll’s 1876 Voting System is Complete for Parallel Access to NP (EH, LAH, JR), pp. 214–224.

CADE-1997-RousselM #calculus #compilation

Exact Kanowledge Compilation in Predicate Calculus: The Partial Achievement Case (OR, PM), pp. 161–175.

LICS-1997-PottsEE #semantics

Semantics of Exact Real Arithmetic (PJP, AE, MHE), pp. 248–257.

DAC-1996-ChenS #algorithm #power management

An Exact Algorithm for Low Power Library-Specific Gate Re-Sizing (DSC, MS), pp. 783–788.

ICSE-1996-Forgacs #analysis #array #data flow #testing

An Exact Array Reference Analysis for Data Flow Testing (IF), pp. 565–574.

CSL-1996-Merkle #bound

Exact Pairs for Abstract Bounded Reducibilities (WM), pp. 349–368.

DAC-1994-ChakradharBA #algorithm

An Exact Algorithm for Selecting Partial Scan Flip-Flops (STC, AB, VDA), pp. 81–86.

DAC-1994-KamVBS #algorithm

A Fully Implicit Algorithm for Exact State Minimization (TK, TV, RKB, ALSV), pp. 684–690.

DAC-1994-LamBS #finite #state machine

Exact Minimum Cycle Times for Finite State Machines (WKCL, RKB, ALSV), pp. 100–105.

DAC-1994-RadivojevicB #execution #scheduling

Incorporating Speculative Execution in Exact Control-Dependent Scheduling (IPR, FB), pp. 479–484.

DAC-1994-SaldanhaHMBS #optimisation #performance #using

Performance Optimization Using Exact Sensitization (AS, HH, PCM, RKB, ALSV), pp. 425–429.

DAC-1994-TsuiPD #approximate

Exact and Approximate Methods for Calculating Signal and Transition Probabilities in FSMs (CYT, MP, AMD), pp. 18–23.

DAC-1993-LamBS #modelling #using

Circuit Delay Models and Their Exact Computation Using Timed Boolean Functions (WKCL, RKB, ALSV), pp. 128–134.

DAC-1993-McGeerSBS #logic #named

Espresso-Signature: A New Exact Minimizer for Logic Functions (PCM, JVS, RKB, ALSV), pp. 618–624.

ICALP-1993-FlajoletG #divide and conquer

Exact Asymptotics of Divide-and-Conquer Recurrences (PF, MJG), pp. 137–149.

DAC-1992-KubiakPFS #evaluation

Exact Evaluation of Diagnostic Test Resolution (KK, SP, WKF, RAS), pp. 347–352.

DAC-1992-PixleyJH #diagrams #sequence

Exact Calculation of Synchronization Sequences Based on Binary Decision Diagrams (CP, SWJ, GDH), pp. 620–623.

DAC-1992-SarabiP #canonical #network #performance

Fast Exact and Quasi-Minimal Minimization of Highly Testable Fixed-Polarity AND/XOR Canonical Networks (AS, MAP), pp. 30–35.

DAC-1992-StollD #constraints #synthesis

High-Level Synthesis from VHDL with Exact Timing Constraints (AS, PD), pp. 188–193.

DAC-1991-MaziaszH

Exact Width and Height Minimization of CMOS Cells (RLM, JPH), pp. 487–493.

PLDI-1991-MaydanHL #analysis #data flow #dependence #performance

Efficient and Exact Data Dependence Analysis (DEM, JLH, MSL), pp. 1–14.

KR-1989-RossiM #constraints #linear #network #using

Exact Solution in Linear Time of Networks of Constraints Using Perfect Relaxation (FR, UM), pp. 394–399.

STOC-1988-Ko

Relativized Polynominal Time Hierarchies Having Exactly K Levels (KIK), pp. 245–253.

LFP-1988-Vuillemin

Exact Real Computer Arithmetic with Continued Fractions (JV), pp. 14–27.

CSL-1987-Speckenmeyer #backtracking #complexity #on the #problem #satisfiability

On the Average Case Complexity of Backtracking for the Exact-Satisfiability Problem (ES), pp. 281–288.

STOC-1986-Barrington #bound #branch #source code

Bounded-Width Polynomial-Size Branching Programs Recognize Exactly Those Languages in NC¹ (DAMB), pp. 1–5.

LFP-1986-BoehmCRO #case study #higher-order #programming

Exact Real Arithmetic: A Case Study in Higher Order Programming (HJB, RC, MR, MJO), pp. 162–173.

STOC-1984-GoldbergM #on the #problem

On Finding the Exact Solution of a Zero-One Knapsack Problem (AVG, AMS), pp. 359–368.

ICSE-1984-MaibaumT #on the #what

On What Exactly Is Going On When Software Is Developed Step-by-Step (TSEM, WMT), pp. 528–533.

STOC-1978-CarterFGMW #approximate

Exact and Approximate Membership Testers (LC, RWF, JG, GM, MNW), pp. 59–65.