BibSLEIGH
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Used together with:
search (14)
test (9)
program (6)
use (6)
effici (5)

Stem exhaust$ (all stems)

40 papers:

KDDKDD-2015-HouWGD #clustering #programming #rank
Non-exhaustive, Overlapping Clustering via Low-Rank Semidefinite Programming (YH, JJW, DFG, ISD), pp. 427–436.
OOPSLAOOPSLA-2015-DietrichHS #analysis #java #points-to
Giga-scale exhaustive points-to analysis for Java in under a minute (JD, NH, BS), pp. 535–551.
ICLPICLP-2015-ElsawyZA #execution #revisited
CHR Exhaustive Execution — Revisited (AE, AZ, SA).
VMCAIVMCAI-2015-ChristakisG #composition #image #memory management #parsing #proving #safety #testing #using
Proving Memory Safety of the ANI Windows Image Parser Using Compositional Exhaustive Testing (MC, PG), pp. 373–392.
CSCWCSCW-2014-SunXA
Exhaustive search of puzzles in operational transformation (CS, YX, A), pp. 519–529.
OOPSLAOOPSLA-2014-RosnerBPKAFK #bound #generative #hybrid #invariant
Bounded exhaustive test input generation from hybrid invariants (NR, VSB, PP, SAK, NA, MFF, SK), pp. 655–674.
LOPSTRLOPSTR-2014-ElsawyZA #execution #text-to-text
Exhaustive Execution of CHR Through Source-to-Source Transformation (AE, AZ, SA), pp. 59–73.
PLDIPLDI-2013-IsradisaikulM #pattern matching
Reconciling exhaustive pattern matching with objects (CI, ACM), pp. 343–354.
ICTSSICTSS-2013-HuangP #equivalence #modelling #testing
Exhaustive Model-Based Equivalence Class Testing (WlH, JP), pp. 49–64.
TAPTAP-2012-BengoleaAMF #bound #test coverage #testing #using
Using Coverage Criteria on RepOK to Reduce Bounded-Exhaustive Test Suites (VSB, NA, DM, MFF), pp. 19–34.
ASEASE-2011-ParizekL #identification #traversal
Identifying future field accesses in exhaustive state space traversal (PP, OL), pp. 93–102.
DATEDATE-2011-BarceloGBS #estimation #performance #scalability
An efficient and scalable STA tool with direct path estimation and exhaustive sensitization vector exploration for optimal delay computation (SB, XG, SAB, JS), pp. 1602–1607.
ICDARICDAR-2011-NeumannM #image #locality #using
Text Localization in Real-World Images Using Efficiently Pruned Exhaustive Search (LN, JM), pp. 687–691.
ITiCSEITiCSE-2011-CamachoM #learning #programming
Facilitating learning dynamic programming through a previous introduction of exhaustive search (AC, AM), p. 355.
ICEISICEIS-v1-2011-BiniLSSA #algorithm
Non-exhaustive Join Ordering Search Algorithms for LJQO (TAB, AL, MSS, FS, ECdA), pp. 151–156.
TAPTAP-2011-AguirreBFG #black box #bound #generative #test coverage #testing
Incorporating Coverage Criteria in Bounded Exhaustive Black Box Test Generation of Structural Inputs (NA, VSB, MFF, JPG), pp. 15–32.
STOCSTOC-2010-Williams #bound
Improving exhaustive search implies superpolynomial lower bounds (RW), pp. 231–240.
FASEFASE-2009-JagannathLDM #bound #cost analysis #testing
Reducing the Costs of Bounded-Exhaustive Testing (VJ, YYL, BD, DM), pp. 171–185.
KDDKDD-2009-DundarHBRR #case study #dataset #detection #learning #using
Learning with a non-exhaustive training dataset: a case study: detection of bacteria cultures using optical-scattering technology (MD, EDH, AKB, JPR, BR), pp. 279–288.
KDIRKDIR-2009-PaquetV #2d #3d #multi #product line #realtime
Finding Protein Family Similarities in Real Time through Multiple 3D and 2D Representations, Indexing and Exhaustive Searching (EP, HLV), pp. 127–133.
SACSAC-2009-NamakiBM #performance
Exhaustion dominated performance: a first attempt (NN, AdB, SMC), pp. 1011–1012.
CIAACIAA-2007-BassinoDN #automaton #library
: A Library to Randomly and Exhaustively Generate Automata (FB, JD, CN), pp. 303–305.
PADLPADL-2007-MorimotoTI #performance
Instantly Turning a Naive Exhaustive Search into Three Efficient Searches with Pruning (TM, YT, HI), pp. 65–79.
LICSLICS-2007-Escardo #infinity #performance #set
Infinite sets that admit fast exhaustive search (MHE), pp. 443–452.
CIKMCIKM-2006-OgilvieL #evaluation #retrieval #xml
Investigating the exhaustivity dimension in content-oriented XML element retrieval evaluation (PO, ML), pp. 84–93.
KDDKDD-2006-MorchenMU #generative #modelling #music #statistics
Understandable models Of music collections based on exhaustive feature generation with temporal statistics (FM, IM, AU), pp. 882–891.
CGOCGO-2006-KulkarniWTD #optimisation #order
Exhaustive Optimization Phase Order Space Exploration (PAK, DBW, GST, JWD), pp. 306–318.
CAVCAV-2005-NieuwenhuisO #difference #logic
DPLL(T) with Exhaustive Theory Propagation and Its Application to Difference Logic (RN, AO), pp. 321–334.
CIKMCIKM-2004-PiwowarskiL #consistency #evaluation #retrieval #xml
Providing consistent and exhaustive relevance assessments for XML retrieval evaluation (BP, ML), pp. 361–370.
ICPRICPR-v3-2002-FitchKCK #performance #robust
Fast Exhaustive Robust Matching (AJF, AK, WJC, JK), pp. 903–906.
LOPSTRLOPSTR-1998-Rosenblueth #source code #using
An Exhaustive-Search Method Using Layered Streams Obtained Through a Meta-Interpreter for Chain Programs (DAR), pp. 322–324.
DATEEDTC-1997-LaquaiRW #metric #performance #testing
A production-oriented measurement method for fast and exhaustive Iddq tests (BL, HR, HW), pp. 279–286.
DACDAC-1996-LiouLC #performance #pipes and filters #pseudo #testing
Area Efficient Pipelined Pseudo-Exhaustive Testing with Retiming (HYL, TTYL, CKC), pp. 274–279.
PLDIPLDI-1996-SreedharGL #analysis #data flow #framework #graph #incremental #using
A New Framework for Exhaustive and Incremental Data Flow Analysis Using DJ Graphs (VCS, GRG, YFL), pp. 278–290.
DACDAC-1993-SrinivasanGB #clustering #performance #pseudo #testing
An Efficient Partitioning Strategy for Pseudo-Exhaustive Testing (RS, SKG, MAB), pp. 242–248.
FPCAFPCA-1991-LeungM #lazy evaluation #reasoning
Reasoning about Simple and Exhaustive Demand in Highter-Order Lazy Languages (AL, PM), pp. 328–351.
PPoPPPPoPP-1990-FuruichiTI #multi #source code
A Multi-Level Load Balancing Scheme for OR-Parallel Exhaustive Search Programs on the Multi-PSI (MF, KT, NI), pp. 50–59.
ICLPICLP-1987-Ueda87 #source code
Making Exhaustive Search Programs Deterministic, Part II (KU), pp. 356–375.
ICLPICLP-1986-Ueda86 #source code
Making Exhaustive Search Programs Deterministic (KU), pp. 270–282.
PLDISCC-1982-KrummeA #code generation
A Practical Method for Code Generation Based on Exhaustive Search (DWK, DHA), pp. 185–196.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.