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:
model (10)
conflict (10)
use (10)
inconsist (8)
system (8)

Stem resolv$ (all stems)

80 papers:

CASECASE-2015-KaipaTSKLG #automation #using
Resolving automated perception system failures in bin-picking tasks using assistance from remote human operators (KNK, SSTK, SS, AMK, JDL, SKG), pp. 1453–1458.
ECMFAECMFA-J-2012-PuissantSM15 #automation #consistency #nondeterminism #using
Resolving model inconsistencies using automated regression planning (JPP, RVDS, TM), pp. 461–481.
DATEDATE-2014-GemmekeSSRCA #memory management
Resolving the memory bottleneck for single supply near-threshold computing (TG, MMS, JS, PR, FC, DA), pp. 1–6.
SIGMODSIGMOD-2014-LiLGZFH #estimation #reliability #semistructured data
Resolving conflicts in heterogeneous data by truth discovery and source reliability estimation (QL, YL, JG, BZ, WF, JH), pp. 1187–1198.
ESOPESOP-2014-BocchiMT #nondeterminism
Resolving Non-determinism in Choreographies (LB, HCM, ET), pp. 493–512.
LISPILC-2014-Strandh14b
Resolving Metastability Issues During Bootstrapping (RS), p. 103.
CIKMCIKM-2014-DuQF #approach #fine-grained #owl
A Practical Fine-grained Approach to Resolving Incoherent OWL 2 DL Terminologies (JD, GQ, XF), pp. 919–928.
ASPLOSASPLOS-2014-Wood #architecture #named
Resolved: specialized architectures, languages, and system software should supplant general-purpose alternatives within a decade (DAW), pp. 653–654.
CHICHI-2013-RauARR #design #interactive #learning #why
Why interactive learning environments can have it all: resolving design conflicts between competing goals (MAR, VA, NR, SR), pp. 109–118.
ASEASE-2012-RederE #consistency #design #modelling #nondeterminism
Computing repair trees for resolving inconsistencies in design models (AR, AE), pp. 220–229.
ECMFAECMFA-2012-PuissantSM #consistency #design #named #nondeterminism
Badger: A Regression Planner to Resolve Design Model Inconsistencies (JPP, RVDS, TM), pp. 146–161.
RERE-2012-AroraSR #feature model #interactive #nondeterminism
Resolving uncertainty in automotive feature interactions (SA, PS, SR), pp. 21–30.
SACSAC-2012-NunesCM #learning #network #similarity #social
Resolving user identities over social networks through supervised learning and rich similarity features (AN, PC, BM), pp. 728–729.
DocEngDocEng-2011-KarolNKAM #adaptation #aspect-oriented #detection #multi #xml
Detecting and resolving conflicts between adaptation aspects in multi-staged XML transformations (SK, MN, DK, UA, KM), pp. 229–238.
ICDARICDAR-2011-LeloreB #algorithm
Super-Resolved Binarization of Text Based on the FAIR Algorithm (TL, FB), pp. 839–843.
ECMFAECMFA-2011-StraetenPM #consistency #nondeterminism
Assessing the Kodkod Model Finder for Resolving Model Inconsistencies (RVDS, JPP, TM), pp. 69–84.
PLDIPLDI-2010-MightSH #functional #object-oriented #program analysis
Resolving and exploiting the k-CFA paradox: illuminating functional vs. object-oriented program analysis (MM, YS, DVH), pp. 305–315.
ICALPICALP-v1-2010-Welzl #constraints #satisfiability
When Conflicting Constraints Can Be Resolved — The Lovász Local Lemma and Satisfiability (EW), p. 18.
ICALPICALP-v2-2010-BlockiW #complexity #privacy #problem
Resolving the Complexity of Some Data Privacy Problems (JB, RW), pp. 393–404.
DATEDATE-2009-KwonYUJ #performance #problem
In-network reorder buffer to improve overall NoC performance while resolving the in-order requirement problem (WCK, SY, JU, SWJ), pp. 1058–1063.
SIGMODSIGMOD-2009-SunLDC #analysis #detection #workflow
Detecting and resolving unsound workflow views for correct provenance analysis (PS, ZL, SBD, YC), pp. 549–562.
VLDBVLDB-2009-DongN #data fusion #integration
Data fusion — Resolving Data Conflicts for Integration (XLD, FN), pp. 1654–1655.
VLDBVLDB-2009-SunLNDC #analysis #detection #named #workflow
WOLVES: Achieving Correct Provenance Analysis by Detecting and Resolving Unsound Workflow Views (PS, ZL, SN, SBD, YC), pp. 1614–1617.
ESOPESOP-2009-LakinP #functional #higher-order #induction #programming
Resolving Inductive Definitions with Binders in Higher-Order Typed Functional Programming (MRL, AMP), pp. 47–61.
SCAMSCAM-2009-QianZX #analysis #lazy evaluation
Improving Side-Effect Analysis with Lazy Access Path Resolving (JQ, YZ, BX), pp. 35–44.
HCIHCI-AUII-2009-TokiwaYNSI #using
Motion Capture System Using an Optical Resolver (TT, MY, HN, MS, MI), pp. 536–543.
CIKMCIKM-2009-LiuLW #order
Post-rank reordering: resolving preference misalignments between search engines and end users (CL, ML, YMW), pp. 641–650.
SACSAC-2008-ZhouTBAG #ambiguity #graph #named #query
Gcon: a graph-based technique for resolving ambiguity in query translation candidates (DZ, MT, TJB, HA, JG), pp. 1566–1573.
ICLPICLP-2008-Gosti #csp #game studies
Resolving CSP with Naming Games (GG), pp. 807–808.
DACDAC-2007-ShachamY #on the fly
On-The-Fly Resolve Trace Minimization (OS, KY), pp. 594–599.
CSEETCSEET-2007-Parnas #education #re-engineering
Resolving Dilemmas in Software Engineering Education (DLP).
ICALPICALP-2007-CaiL #algorithm #artificial reality #power of
Holographic Algorithms: The Power of Dimensionality Resolved (JyC, PL), pp. 631–642.
HCIHCI-IPT-2007-LiGR #artificial reality
Resolving Occlusion Between Virtual and Real Scenes for Augmented Reality Applications (LL, TG, BR), pp. 634–642.
HCIHIMI-IIE-2007-ZhangWE #collaboration #comprehension
Resolving Assumptions in Art-Technology Collaboration as a Means of Extending Shared Understanding (YZ, AW, EAE), pp. 204–211.
OOPSLAOOPSLA-2007-DucasseWBN
User-changeable visibility: resolving unanticipated name clashes in traits (SD, RW, AB, ON), pp. 171–190.
ICSEICSE-2007-GrahamKW #architecture #trade-off
Agility and Experimentation: Practical Techniques for Resolving Architectural Tradeoffs (TCNG, RK, CW), pp. 519–528.
CBSECBSE-2006-BondarevCW #architecture #component #performance #process #trade-off
A Process for Resolving Performance Trade-Offs in Component-Based Architectures (EB, MRVC, PHNdW), pp. 254–269.
CASECASE-2006-ShangYQ #algorithm #equation #linear
Algorithm of Two-Step Eye-Hand Calibration by Resolving Linear Equations (YS, QY, ZQ), pp. 218–222.
DocEngDocEng-2006-LumleyGR #layout
Resolving layout interdependency with presentational variables (JWL, RG, OR), pp. 95–97.
CIAACIAA-2006-GalvezSF #bound #linear #lookahead #parsing
Shift-Resolve Parsing: Simple, Unbounded Lookahead, Linear Time (JFG, SS, JF), pp. 253–264.
CAiSECAiSE-2006-Al-MuhammedE #constraints
Resolving Underconstrained and Overconstrained Systems of Conjunctive Constraints for Service Requests (MAM, DWE), pp. 223–238.
ICPRICPR-v1-2006-KimC #ambiguity #clustering #permutation
ICA-Based Clustering for Resolving Permutation Ambiguity in Frequency-Domain Convolutive Source Separation (MK, SC), pp. 950–954.
MODELSMoDELS-2006-MensSD #analysis #consistency #dependence #detection #nondeterminism #using
Detecting and Resolving Model Inconsistencies Using Transformation Dependency Analysis (TM, RVDS, MD), pp. 200–214.
MODELSMoDELS-2006-MensSD #analysis #consistency #dependence #detection #nondeterminism #using
Detecting and Resolving Model Inconsistencies Using Transformation Dependency Analysis (TM, RVDS, MD), pp. 200–214.
ICSEICSE-2006-Deng #challenge #component #deployment #enterprise #framework #generative
Resolving component deployment & configuration challenges for enterprise DRE systems via frameworks & generative techniques (GD), pp. 945–948.
ESEC-FSEESEC-FSE-2005-BakerBJKTMB #detection #diagrams #semantics #sequence chart #uml
Detecting and resolving semantic pathologies in UML sequence diagrams (PB, PB, CJ, DJK, RT, BM, SB), pp. 50–59.
ICSTSAT-J-2004-Biere05
Resolve and Expand (AB), pp. 59–70.
CBSECBSE-2004-MinCK #component #off the shelf #problem #using
Using Smart Connectors to Resolve Partial Matching Problems in COTS Component Acquisition (HGM, SWC, SDK), pp. 40–47.
WICSAWICSA-2004-PoortW #composition #non-functional
Resolving Requirement Conflicts through Non-Functional Decomposition (ERP, PHNdW), pp. 145–154.
DACDAC-2004-KapoorJ #concurrent #logic #specification #synthesis
Decomposing specifications with concurrent outputs to resolve state coding conflicts in asynchronous logic synthesis (HKK, MBJ), pp. 830–833.
IWPCIWPC-2004-WuH #modelling
Resolving Linkage Anomalies in Extracted Software System Models (JW, RCH), pp. 241–245.
PASTEPASTE-2004-Ezick #analysis #constraints #query
Resolving and applying constraint queries on context-sensitive analyses (JE), pp. 2–7.
ICPRICPR-v1-2004-Zhao #scalability #video
Super-Resolving Compressed Video with Large Artifacts (WYZ), pp. 516–519.
OOPSLAOOPSLA-2004-ZhangJ04a #middleware
Resolving feature convolution in middleware systems (CZ, HAJ), pp. 188–205.
FSEFSE-2004-Egyed #analysis #nondeterminism
Resolving uncertainties during trace analysis (AE), pp. 3–12.
SATSAT-2004-Biere
Resolve and Expand (AB), pp. 238–246.
RERE-2003-LutzM #requirements #testing
Resolving Requirements Discovery in Testing and Operations (RRL, ICM), p. 33–?.
KRKR-2002-LangM #consistency #nondeterminism
Resolving Inconsistencies by Variable Forgetting (JL, PM), pp. 239–250.
SIGIRSIGIR-2002-GaoZNHC #ambiguity #dependence #query #using
Resolving query translation ambiguity using a decaying co-occurrence model and syntactic dependence relations (JG, MZ, JYN, HH, WC), pp. 183–190.
SACSAC-2002-YoungBGL #difference #object-oriented #using
Using an object oriented model for resolving representational differences between heterogeneous systems (PY, VB, JG, L), pp. 976–983.
ICPRICPR-v3-2000-HufnaglU #classification #fault #performance
Resolving a Defect in Quadrant-Based Classification for Fast Block-Matching (CH, AU), pp. 3203–3206.
ICPRICPR-v3-2000-LiuTW #self
Resolving Ambiguities of Self-Calibration in Turntable Motion (YL, HTT, CW), pp. 3873–3876.
FSEFSE-2000-HayA #interactive
Composing features and resolving interactions (JDH, JMA), pp. 110–119.
FSEFSE-2000-HollingsworthBW #case study #experience #using
Experience report: using RESOLVE/C++ for commercial software (JEH, LB, BWW), pp. 11–19.
SIGIRSIGIR-1998-BallesterosC #ambiguity #retrieval
Resolving Ambiguity for Cross-Language Retrieval (LB, WBC), pp. 64–71.
STOCSTOC-1997-Dietzfelbinger #communication #complexity #problem
The Linear-Array Problem in Communication Complexity Resolved (MD), pp. 373–382.
CCCC-1996-GeserKLRS #fixpoint #higher-order
Non-monotone Fixpoint Iterations to Resolve Second Order Effects (AG, JK, GL, OR, BS), pp. 106–120.
DACDAC-1993-KriplaniNYH #correlation
Resolving Signal Correlations for Estimating Maximum Currents in CMOS Combinational Circuits (HK, FNN, PY, INH), pp. 384–388.
HTHT-1993-TompaBR #component #hypermedia
Hypertext by Link-Resolving Components (FWT, GEB, DRR), pp. 118–130.
ICALPICALP-1993-DillencourtS
A Simple Method for Resolving Degeneracies in Delaunay Triangulations (MBD, WDS), pp. 177–188.
ICLPILPS-1993-YouY #logic programming #source code
Contradiction Resolving for Extended Logic Programs and Default Theories (JHY, LYY), p. 640.
KRKR-1992-PinkasL #consistency #nondeterminism #reasoning #taxonomy
Reasoning from Inconsistency: A Taxonomy of Principles for Resolving Conflict (GP, RPL), pp. 709–719.
VLDBVLDB-1991-SiegelM #approach #metadata #semantics
A Metadata Approach to Resolving Semantic Conflicts (MS, SEM), pp. 133–145.
POPLPOPL-1989-SagivEFR #analysis #attribute grammar #data flow
Resolving Circularity in Attribute Grammars with Applications to Data Flow Analysis (SS, OE, NF, MR), pp. 36–48.
SIGMODSIGMOD-1988-MazumdarSS #proving #security #theorem proving #using
Resolving the Tension between Integrity and Security Using a Theorem Prover (SM, DWS, TS), pp. 233–242.
STOCSTOC-1988-JerrumS #agile #approximate #markov
Conductance and the Rapid Mixing Property for Markov Chains: the Approximation of the Permanent Resolved (Preliminary Version) (MJ, AS), pp. 235–244.
STOCSTOC-1984-Willard #protocol
Log-Logarithmic Protocols for Resolving Ethernet and Semaphore Conflicts (Preliminary Report) (DEW), pp. 512–521.
CADECADE-1982-HenschenN #database #first-order #infinity #recursion #representation #sequence
Representing Infinite Sequences of Resolvents in recursive First-Order Horn Databases (LJH, SAN), pp. 342–359.
STOCSTOC-1971-Wise #algorithm
Domolki’s Algorithm Applied to Generalized Overlap Resolvable Grammars (DSW), pp. 171–184.
SIGIRSIGIR-1971-DostertT #ambiguity #how
How Features Resolve Syntactic Ambiguity (BHD, FBT), pp. 19–32.

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.