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:
problem (239)
constraint (118)
use (79)
sat (53)
algorithm (46)

Stem solv$ (all stems)

558 papers:

CASECASE-2015-KouiderHOO #approach #graph #integer #linear #scheduling #source code
Mixed integer linear programs and tabu search approach to solve mixed graph coloring for unit-time job shop scheduling (AK, HAH, SO, AO), pp. 1177–1181.
DATEDATE-2015-BiewerAGSH #approach #coordination #realtime #synthesis
A symbolic system synthesis approach for hard real-time systems based on coordinated SMT-solving (AB, BA, JG, TS, CH), pp. 357–362.
DATEDATE-2015-GitinaWRSSB #quantifier
Solving DQBF through quantifier elimination (KG, RW, SR, MS, CS, BB), pp. 1617–1622.
VLDBVLDB-2015-Balazinska15a #big data #data analysis #industrial #problem #question
Big Data Research: Will Industry Solve all the Problems? (MB), pp. 2053–2064.
ITiCSEITiCSE-2015-Kumar #problem #semantics
Solving Code-tracing Problems and its Effect on Code-writing Skills Pertaining to Program Semantics (ANK), pp. 314–319.
TACASTACAS-2015-BransenBCD #attribute grammar #order #scheduling #using
Linearly Ordered Attribute Grammar Scheduling Using SAT-Solving (JB, LTvB, KC, AD), pp. 289–303.
STOCSTOC-2015-AggarwalDRS #problem #using
Solving the Shortest Vector Problem in 2n Time Using Discrete Gaussian Sampling: Extended Abstract (DA, DD, OR, NSD), pp. 733–742.
ICALPICALP-v1-2015-BeiCZ #constraints #linear #programming
Solving Linear Programming with Constraints Unknown (XB, NC, SZ), pp. 129–142.
FMFM-2015-SchneiderLW #modelling #problem #validation
Model-Based Problem Solving for University Timetable Validation and Improvement (DS, ML, TW), pp. 487–495.
SEFMSEFM-2015-VollingerR #algorithm #certification #distributed #problem
Certification of Distributed Algorithms Solving Problems with Optimal Substructure (KV, WR), pp. 190–195.
HCILCT-2015-CastilloDSTC #detection #student
Model for Detecting Student Difficulties in Solving Formative Assessments (CC, NDD, AS, VT, DAOC), pp. 199–207.
ICMLICML-2015-FilipponeE #linear #probability #process #scalability
Enabling scalable stochastic gradient-based inference for Gaussian processes by employing the Unbiased LInear System SolvEr (ULISSE) (MF, RE), pp. 1015–1024.
OOPSLAOOPSLA-2015-FelgentreffMBH #constraints #programming language #theorem proving
Checks and balances: constraint solving without surprises in object-constraint programming languages (TF, TDM, AB, RH), pp. 767–782.
PADLPADL-2015-DymchenkoM #problem
Declaratively Solving Google Code Jam Problems with Picat (SD, MM), pp. 50–57.
SACSAC-2015-DymchenkoM #eclipse #problem #prolog
Declaratively solving tricky google code jam problems with prolog-based ECLiPSe CLP system (SD, MM), pp. 2122–2124.
ICSEICSE-v1-2015-HenardPHT #configuration management #constraints #multi #product line #scalability #theorem proving
Combining Multi-Objective Search and Constraint Solving for Configuring Large Software Product Lines (CH, MP, MH, YLT), pp. 517–528.
SLESLE-2015-OchoaRT #feature model #modelling #using
Using decision rules for solving conflicts in extended feature models (LO, OGR, TT), pp. 149–160.
ICSTICST-2015-YamadaKACOB #combinator #incremental #optimisation #satisfiability #testing
Optimization of Combinatorial Testing by Incremental SAT Solving (AY, TK, CA, EHC, YO, AB), pp. 1–10.
ISSTAISSTA-2015-KhoshnoodKW #concurrent #constraints #debugging #named #theorem proving
ConcBugAssist: constraint solving for diagnosis and repair of concurrency bugs (SK, MK, CW), pp. 165–176.
ICSTSAT-2015-BurchardSB #parallel #satisfiability
Laissez-Faire Caching for Parallel #SAT Solving (JB, TS, BB), pp. 46–61.
ICSTSAT-2015-CorziliusKJSA #c++ #named #open source #parallel #smt
SMT-RAT: An Open Source C++ Toolbox for Strategic and Parallel SMT Solving (FC, GK, SJ, SS, ), pp. 360–368.
ICSTSAT-2015-MangalZNN #framework #lazy evaluation #named #satisfiability #scalability
Volt: A Lazy Grounding Framework for Solving Very Large MaxSAT Instances (RM, XZ, AVN, MN), pp. 299–306.
ICSTSAT-2015-NevesMJLM #satisfiability
Exploiting Resolution-Based Representations for MaxSAT Solving (MN, RM, MJ, IL, VMM), pp. 272–286.
ICSTSAT-2015-TuHJ #learning #named #reasoning #satisfiability
QELL: QBF Reasoning with Extended Clause Learning and Levelized SAT Solving (KHT, TCH, JHRJ), pp. 343–359.
CASECASE-2014-GunawanNPL #hybrid #metaheuristic #polynomial #problem
Hybrid metaheuristics for solving the quadratic assignment problem and the generalized quadratic assignment problem (AG, KMN, KLP, HCL), pp. 119–124.
CASECASE-2014-XuJGX #energy #scalability
A new method to solve large-scale building energy management for energy saving (ZX, QSJ, XG, XX), pp. 940–945.
DATEDATE-2014-BiewerGH #novel #smt
A novel model for system-level decision making with combined ASP and SMT solving (AB, JG, CH), pp. 1–4.
VLDBVLDB-2015-SunWQZL14 #approximate #named #nearest neighbour #query
SRS: Solving c-Approximate Nearest Neighbor Queries in High Dimensional Euclidean Space with a Tiny Index (YS, WW, JQ, YZ, XL), pp. 1–12.
ITiCSEITiCSE-2014-MI14a #principle #problem #using
Problem-solving using the extremality principle (JM, SI), pp. 87–92.
ITiCSEITiCSE-2014-WartVP #design #learning #problem #social
Apps for social justice: motivating computer science learning with design and real-world problem solving (SVW, SV, TSP), pp. 123–128.
ICSMEICSME-2014-AlvesSD #automation #process #quality #standard
Applying ISO/IEC 25010 Standard to Prioritize and Solve Quality Issues of Automatic ETL Processes (TLA, PS, MSD), pp. 573–576.
STOCSTOC-2014-CohenKMPPRX #linear
Solving SDD linear systems in nearly mlog1/2n time (MBC, RK, GLM, JWP, RP, AR, SCX), pp. 343–352.
ICALPICALP-v1-2014-AllamigeonBG #algorithm #game studies #polynomial
The Tropical Shadow-Vertex Algorithm Solves Mean Payoff Games in Polynomial Time on Average (XA, PB, SG), pp. 89–100.
ICALPICALP-v1-2014-GolovnevKM #approach #problem #product line
Families with Infants: A General Approach to Solve Hard Partition Problems (AG, ASK, IM), pp. 551–562.
ICALPICALP-v1-2014-HsuRRU #linear #source code
Privately Solving Linear Programs (JH, AR, TR, JU), pp. 612–624.
ICALPICALP-v2-2014-EmekLUW #finite #problem #state machine
Solving the ANTS Problem with Asynchronous Finite State Machines (YE, TL, JU, RW), pp. 471–482.
LATALATA-2014-MasseGHL #equation #morphism #word
Solving Equations on Words with Morphisms and Antimorphisms (ABM, SG, SH, ML), pp. 186–197.
IFMIFM-2014-BrideKP #constraints #specification #theorem proving #using #verification #workflow
Verifying Modal Workflow Specifications Using Constraint Solving (HB, OK, FP), pp. 171–186.
GRAPHITEGRAPHITE-2014-KantP #game studies #generative
Generating and Solving Symbolic Parity Games (GK, JvdP), pp. 2–14.
GT-VMTGT-VMT-2014-ZambonR #problem #towards
Solving the N-Queens Problem with GROOVE — Towards a Compendium of Best Practices (EZ, AR).
CSCWCSCW-2014-TausczikKK #case study #collaboration #problem
Collaborative problem solving: a study of MathOverflow (YRT, AK, REK), pp. 355–367.
ICEISICEIS-v1-2014-FaheemK #algorithm #architecture #case study #framework #multi #problem
A Multiagent-based Framework for Solving Computationally Intensive Problems on Heterogeneous Architectures — Bioinformatics Algorithms as a Case Study (HMF, BKR), pp. 526–533.
ICEISICEIS-v1-2014-HaddadCSM #algorithm #heuristic #named #parallel #problem #scheduling
AIV: A Heuristic Algorithm based on Iterated Local Search and Variable Neighborhood Descent for Solving the Unrelated Parallel Machine Scheduling Problem with Setup Times (MNH, LPC, MJFS, NM), pp. 376–383.
ICEISICEIS-v1-2014-SilveiraCC #case study #problem
A Problem-solving Agent to Test Rational Agents — A Case Study with Reactive Agents (FRdVS, GALdC, MIC), pp. 505–513.
CIKMCIKM-2014-SchneiderBV #linear #multi
Solving Linear SVMs with Multiple 1D Projections (JS, JB, MV), pp. 221–230.
ICPRICPR-2014-MasselliZ #approach #geometry #performance #problem
A New Geometric Approach for Faster Solving the Perspective-Three-Point Problem (AM, AZ), pp. 2119–2124.
KEODKEOD-2014-AkamaN #problem
Solving Query-answering Problems with If-and-Only-If Formulas (KA, EN), pp. 333–344.
KMISKMIS-2014-FrancoisMA #communication #design #email #problem #traceability #using
Discovering Problem-Solving Knowledge in Business Emails — Traceability in Software Design Using Computer Mediated Communication (RF, NM, HA), pp. 186–193.
KRKR-2014-BaierMM #problem
Diagnostic Problem Solving via Planning with Ontic and Epistemic Goals (JAB, BM, SAM).
KRKR-2014-ClercqBSCN #game studies #programming #set #using
Using Answer Set Programming for Solving Boolean Games (SDC, KB, SS, MDC, AN).
SEKESEKE-2014-FuadD #design #development #interactive #mobile #problem
Design and Development of a Mobile Classroom Response Software for Interactive Problem Solving (MMF, DD), pp. 49–52.
PADLPADL-2014-CampeottoPDFP #constraints #theorem proving
Exploring the Use of GPUs in Constraint Solving (FC, ADP, AD, FF, EP), pp. 152–167.
POPLPOPL-2014-BeyeneCPR #approach #constraints #game studies #graph #infinity
A constraint-based approach to solving games on infinite graphs (TAB, SC, CP, AR), pp. 221–234.
FSEFSE-2014-DingesA #heuristic
Solving complex path conditions through heuristic search on induced polytopes (PD, GAA), pp. 425–436.
ICSEICSE-2014-DegiovanniAAU #automation #satisfiability
Automated goal operationalisation based on interpolation and SAT solving (RD, DA, NA, SU), pp. 129–139.
SPLCSPLC-2014-Hubaux #product line #research #what
What research in software product line engineering is not solving in configuration (AH), p. 19.
CAVCAV-2014-NarodytskaLBRW #game studies
Solving Games without Controllable Predecessor (NN, AL, FB, LR, AW), pp. 533–540.
ICLPICLP-J-2014-AmadiniGM #approach #constraints #lazy evaluation #named #theorem proving
SUNNY: a Lazy Portfolio Approach for Constraint Solving (RA, MG, JM), pp. 509–524.
ICLPICLP-J-2014-BartakZ #logic programming #problem #using
Using Tabled Logic Programming to Solve the Petrobras Planning Problem (RB, NFZ), pp. 697–710.
ICTSSICTSS-2014-AliY #algorithm #constraints #normalisation #ocl
Evaluating Normalization Functions with Search Algorithms for Solving OCL Constraints (SA, TY), pp. 17–31.
IJCARIJCAR-2014-StumpST #framework #logic #named
StarExec: A Cross-Community Infrastructure for Logic Solving (AS, GS, CT), pp. 367–373.
ICSTSAT-2014-JordanKLS #named #parallel #towards
MPIDepQBF: Towards Parallel QBF Solving without Knowledge Sharing (CJ, LK, FL, MS), pp. 430–437.
ICSTSAT-2014-LarrazORR #constraints #polynomial
Minimal-Model-Guided Approaches to Solving Polynomial Constraints and Extensions (DL, AO, ERC, AR), pp. 333–350.
ICSTSAT-2014-SaetherTV #satisfiability
Solving MaxSAT and #SAT on Structured CNF Formulas (SHS, JAT, MV), pp. 16–31.
ICSTSAT-2014-SakaiST #reduction #satisfiability #strict
Solving Sparse Instances of Max SAT via Width Reduction and Greedy Restriction (TS, KS, ST), pp. 32–47.
DACDAC-2013-KimJK #algorithm #problem
An optimal algorithm of adjustable delay buffer insertion for solving clock skew variation problem (JK, DJ, TK), p. 6.
DACDAC-2013-WuH #constraints #framework #multi #random #robust #set #theorem proving #verification
A robust constraint solving framework for multiple constraint sets in constrained random verification (BHW, CY(H), p. 7.
DATEDATE-2013-GoultiaevaSB
Bridging the gap between dual propagation and CNF-based QBF solving (AG, MS, AB), pp. 811–814.
TACASTACAS-2013-WieringaH #incremental #manycore #satisfiability
Asynchronous Multi-core Incremental SAT Solving (SW, KH), pp. 139–153.
SASSAS-2013-BjornerMR #horn clause #on the #quantifier
On Solving Universally Quantified Horn Clauses (NB, KLM, AR), pp. 105–125.
STOCSTOC-2013-KelnerOSZ #algorithm #combinator
A simple, combinatorial algorithm for solving SDD systems in nearly-linear time (JAK, LO, AS, ZAZ), pp. 911–920.
STOCSTOC-2013-Miller #graph #optimisation #problem #scalability #using
Solving large optimization problems using spectral graph theory (GLM), p. 981.
IFMIFM-2013-MorgensternGS #game studies #incremental #induction #using
Solving Games Using Incremental Induction (AM, MG, KS), pp. 177–191.
SEFMSEFM-2013-KeshishzadehMM #automation #debugging #detection #domain-specific language #fault #smt #using
Early Fault Detection in DSLs Using SMT Solving and Automated Debugging (SK, AJM, MRM), pp. 182–196.
HCIDUXU-CXC-2013-ShalashBS #communication #interactive
Interactive System for Solving Children Communication Disorder (WMS, MBs, GS), pp. 462–469.
ICEISICEIS-v1-2013-AlvesL #problem
Solving Planning Problems with LRTA* (RMFA, CRL), pp. 475–481.
ICEISICEIS-v3-2013-SunkleKR #architecture #enterprise #modelling #problem
Intentional Modeling for Problem Solving in Enterprise Architecture (SS, VK, SR), pp. 267–274.
CIKMCIKM-2013-ChengSHZC #named
StaticGreedy: solving the scalability-accuracy dilemma in influence maximization (SC, HS, JH, GZ, XC), pp. 509–518.
ICMLICML-c3-2013-BrechtelGD #incremental #learning #performance #representation
Solving Continuous POMDPs: Value Iteration with Incremental Learning of an Efficient Space Representation (SB, TG, RD), pp. 370–378.
KDDKDD-2013-Neumann #big data #problem #using
Using “big data” to solve “small data” problems (CN), p. 1140.
KEODKEOD-2013-AkamaN #problem #proving
Embedding Proof Problems into Query-answering Problems and Problem Solving by Equivalent Transformation (KA, EN), pp. 253–260.
MODELSMoDELS-2013-SongBCC #adaptation #constraints #modelling #runtime #self #theorem proving #using
Self-adaptation with End-User Preferences: Using Run-Time Models and Constraint Solving (HS, SB, AC, SC), pp. 555–571.
MODELSMoDELS-2013-SongBCC #adaptation #constraints #modelling #runtime #self #theorem proving #using
Self-adaptation with End-User Preferences: Using Run-Time Models and Constraint Solving (HS, SB, AC, SC), pp. 555–571.
QAPLQAPL-2013-BertrandS #automaton #game studies #infinity #probability
Solving Stochastic Büchi Games on Infinite Decisive Arenas (NB, PS), pp. 116–131.
SACSAC-2013-LaroucheMGH #equation #satisfiability #word
Solving equations on words through boolean satisfiability (ML, ABM, SG, SH), pp. 104–106.
SACSAC-2013-NakamuraNTO #problem #towards
Towards solving an obstacle problem by the cooperation of UAVs and UGVs (SN, HN, YT, AO), pp. 77–82.
SACSAC-2013-RabanalR #metaheuristic #polynomial #problem #reduction #using
Using polynomial reductions to test the suitability of metaheuristics for solving NP-complete problems (PR, IR), pp. 194–199.
CADECADE-2013-GangeSSS #composition #constraints #difference
Solving Difference Constraints over Modular Arithmetic (GG, HS, PJS, PS), pp. 215–230.
CAVCAV-2013-BeyenePR #horn clause #quantifier
Solving Existentially Quantified Horn Clauses (TAB, CP, AR), pp. 869–882.
ICSTICST-2013-AbadABCFGMMRV #bound #contract #generative #incremental #satisfiability #testing
Improving Test Generation under Rich Contracts by Tight Bounds and Incremental SAT Solving (PA, NA, VSB, DC, MFF, JPG, TSEM, MMM, NR, IV), pp. 21–30.
ICSTICST-2013-PastoreMF #named #problem #question
CrowdOracles: Can the Crowd Solve the Oracle Problem? (FP, LM, GF), pp. 342–351.
LICSLICS-2013-NainV #game studies #probability
Solving Partial-Information Stochastic Parity Games (SN, MYV), pp. 341–348.
ICSTSAT-2013-AudemardLS #incremental #satisfiability
Improving Glucose for Incremental SAT Solving with Assumptions: Application to MUS Extraction (GA, JML, LS), pp. 309–317.
ICSTSAT-2013-MartinsML #clustering #satisfiability
Community-Based Partitioning for MaxSAT Solving (RM, VMM, IL), pp. 182–191.
TAPTAP-2013-PotzlH #constraints
Solving Constraints for Generational Search (DP, AH), pp. 197–213.
ASEASE-2012-ChenK #automation #testing
Puzzle-based automatic testing: bringing humans into the loop by solving puzzles (NC, SK), pp. 140–149.
DATEDATE-2012-HuangBRBK #scheduling #smt
Static scheduling of a Time-Triggered Network-on-Chip based on SMT solving (JH, JOB, AR, CB, AK), pp. 509–514.
DATEDATE-2012-MarinMLB #design #incremental #using #verification
Verification of partial designs using incremental QBF solving (PM, CM, MDTL, BB), pp. 623–628.
VLDBVLDB-2012-RablSJGMM #big data #challenge #enterprise #performance
Solving Big Data Challenges for Enterprise Application Performance Management (TR, MS, HAJ, SGV, VMM, SM), pp. 1724–1735.
VLDBVLDB-2013-LiDLMS12 #problem #question #web
Truth Finding on the Deep Web: Is the Problem Solved? (XL, XLD, KL, WM, DS), pp. 97–108.
ITiCSEITiCSE-2012-Bunimovich #education #problem
Teachers’ perception of teaching problem-solving strategies to novices (LB), p. 393.
ITiCSEITiCSE-2012-JarusekP #problem
A web-based problem solving tool for introductory computer science (PJ, RP), p. 371.
ITiCSEITiCSE-2012-MorgadoB12a #approach #problem
A structured approach to problem solving in CS1 (CM, FB), p. 399.
FLOPSFLOPS-2012-CastineirasS #constraints #performance #theorem proving
Improving the Performance of FD Constraint Solving in a CFLP System (IC, FSP), pp. 88–103.
ICALPICALP-v1-2012-KleinM
Solving Planar k-Terminal Cut in $O(n^(c√k)) Time (PNK, DM), pp. 569–580.
CHICHI-2012-BoujarwahAA #problem #social
Socially computed scripts to support social problem solving skills (FAB, GDA, RIA), pp. 1987–1996.
ICEISICEIS-J-2012-BonacinHRPB12a #aspect-oriented #collaboration #concept #framework #problem #towards
Pragmatic Aspects of Collaborative Problem Solving: Towards a Framework for Conceptualizing Dynamic Knowledge (RB, HHH, JCdR, RP, MCCB), pp. 410–426.
ICEISICEIS-v3-2012-BonacinHRPB #analysis #aspect-oriented #challenge #problem #social
Interacting with Dynamic Social Knowledge — Revealing Challenges through an Analysis of Pragmatic Aspects of Problem Solving (RB, HHH, JCdR, RP, MCCB), pp. 54–63.
ICPRICPR-2012-AskKA #equation #performance #polynomial #symmetry
Exploiting p-fold symmetries for faster polynomial equation solving (EA, YK, ), pp. 3232–3235.
ICPRICPR-2012-GimelfarbGND #concurrent #optimisation #problem
Concurrent propagation for solving ill-posed problems of global discrete optimisation (GLG, RG, RN, PD), pp. 1864–1867.
KDDKDD-2012-Li #problem
Nine real hard problems we’d like you to solve (RL), p. 1.
KMISKMIS-2012-AkiyoshiSK #learning #problem #towards
A Project Manager Skill-up Simulator Towards Problem Solving-based Learning (MA, MS, NK), pp. 190–195.
KRKR-2012-BaralD #automation #how #learning #programming #set
Solving Puzzles Described in English by Automated Translation to Answer Set Programming and Learning How to Do that Translation (CB, JD).
ECMFAECMFA-2012-BurtonPRKPS #modelling #problem #using
Solving Acquisition Problems Using Model-Driven Engineering (FRB, RFP, LMR, DSK, SMP, SS), pp. 428–443.
PADLPADL-2012-LierlerSTW #declarative #problem
Weighted-Sequence Problem: ASP vs CASP and Declarative vs Problem-Oriented Solving (YL, SS, MT, AW), pp. 63–77.
SACSAC-2012-ManciniFP #combinator #constraints #database #problem #relational #synthesis
Combinatorial problem solving over relational databases: view synthesis through constraint-based local search (TM, PF, JP), pp. 80–87.
SACSAC-2012-Skubch #constraints #realtime
Solving non-linear arithmetic constraints in soft realtime environments (HS), pp. 67–73.
ICSEICSE-2012-LiuZ #automation #constraints #named
Axis: Automatically fixing atomicity violations through solving control constraints (PL, CZ), pp. 299–309.
ICSEICSE-2012-SamirniSAMTH #automation #constraints #fault #generative #html #php #string #theorem proving #using
Automated repair of HTML generation errors in PHP applications using string constraint solving (HS, MS, SA, TDM, FT, LJH), pp. 277–287.
CAVCAV-2012-RondonBKJ #c #named #verification
CSolve: Verifying C with Liquid Types (PMR, AB, MK, RJ), pp. 744–750.
ICLPICLP-2012-DrescherW #generative #lazy evaluation #set
Answer Set Solving with Lazy Nogood Generation (CD, TW), pp. 188–200.
ICLPICLP-2012-MarateaPR #machine learning
Applying Machine Learning Techniques to ASP Solving (MM, LP, FR), pp. 37–48.
ICLPICLP-J-2012-BliemMW #declarative #named #problem #programming #using
D-FLAT: Declarative problem solving using tree decompositions and answer-set programming (BB, MM, SW), pp. 445–464.
ICLPICLP-J-2012-EiterFKR
Conflict-driven ASP solving with external sources (TE, MF, TK, CR), pp. 659–679.
ICLPICLP-J-2012-GebserKS #concurrent #multi #thread
Multi-threaded ASP solving with clasp (MG, BK, TS), pp. 525–545.
ICSTICST-2012-BorgesdABP #execution #metaheuristic #symbolic computation
Symbolic Execution with Interval Solving and Meta-heuristic Search (MB, Md, SA, DHB, CSP), pp. 111–120.
ICSTICST-2012-ChoudharyDBJOI #challenge #internet #modelling #security #testing
Solving Some Modeling Challenges when Testing Rich Internet Applications for Security (SC, MED, GvB, GVJ, IVO, PI), pp. 850–857.
ICSTICST-2012-SiddiquiMK #analysis #constraints #data flow #lightweight #theorem proving
Lightweight Data-Flow Analysis for Execution-Driven Constraint Solving (JHS, DM, SK), pp. 91–100.
ICSTICST-2012-VorobyovK #automation #constraints #generative #static analysis #testing #theorem proving
Combining Static Analysis and Constraint Solving for Automatic Test Case Generation (KV, PK), pp. 915–920.
IJCARIJCAR-2012-BobotCCIMMM #integer #linear
A Simplex-Based Extension of Fourier-Motzkin for Solving Linear Integer Arithmetic (FB, SC, EC, MI, AM, AM, GM), pp. 67–81.
IJCARIJCAR-2012-JovanovicM
Solving Non-linear Arithmetic (DJ, LMdM), pp. 339–354.
ICSTSAT-2012-AbalCHP #problem #term rewriting #using
Using Term Rewriting to Solve Bit-Vector Arithmetic Problems — (Poster Presentation) (IA, AC, JH, JSP), pp. 493–495.
ICSTSAT-2012-AudemardHJLP #parallel #satisfiability
Revisiting Clause Exchange in Parallel SAT Solving (GA, BH, SJ, JML, CP), pp. 200–213.
ICSTSAT-2012-DemirovicG #composition #performance #satisfiability
An Efficient Method for Solving UNSAT 3-SAT and Similar Instances via Static Decomposition — (Poster Presentation) (ED, HG), pp. 489–490.
ICSTSAT-2012-JanotaKMC #refinement
Solving QBF with Counterexample Guided Refinement (MJ, WK, JMS, EMC), pp. 114–128.
ICSTSAT-2012-NadelR #performance #satisfiability
Efficient SAT Solving under Assumptions (AN, VR), pp. 242–255.
ICSTSAT-2012-ZhangMZ #constraints #identification #interactive #optimisation #theorem proving
Faulty Interaction Identification via Constraint Solving and Optimization (JZ, FM, ZZ), pp. 186–199.
SMTSMT-2012-Biere #aspect-oriented #satisfiability
Practical Aspects of SAT Solving (AB), p. 1.
ASEASE-2011-ArcainiGR #automation #generative #optimisation #satisfiability #smt #testing
Optimizing the automatic test generation by SAT and SMT solving for Boolean expressions (PA, AG, ER), pp. 388–391.
CASECASE-2011-AmbrosinoBPSS #modelling #problem
Modeling and solving the train load planning problem in seaport container terminals (DA, AB, MP, SS, SS), pp. 208–213.
CASECASE-2011-FantiSU #constraints #problem #scheduling #symmetry #using
Solving scheduling problems in distribution centers using symmetry breaking constraints (MPF, GS, WU), pp. 58–65.
CASECASE-2011-WuS #bound #multi #problem
A lower and upper bound guided nested partitions method for solving capacitated multi-level production planning problems (TW, LS), pp. 78–83.
DATEDATE-2011-ReimerPSB #integration #orthogonal
Integration of orthogonal QBF solving techniques (SR, FP, CS, BB), pp. 149–154.
ICDARICDAR-2011-LoprestiN #problem #question
When is a Problem Solved? (DPL, GN), pp. 32–36.
CSEETCSEET-2011-Sweedyk #education #how #problem
How middle school teachers solved our SE project problems (ES), pp. 449–453.
ITiCSEITiCSE-2011-LevyV #education #problem
A problem solving teaching guide based on a procedure intertwined with a teaching model (RBBL, JÁVI), p. 374.
ITiCSEITiCSE-2011-MesserK #problem #process
The use of mediating artifacts in embedding problem solving processes in an e-learning environment (OMM, AK), p. 390.
ESOPESOP-2011-GawlitzaM #smt
Improving Strategies via SMT Solving (TMG, DM), pp. 236–255.
TACASTACAS-2011-ChengKLB #algorithm #framework #game studies #research
GAVS+: An Open Platform for the Research of Algorithmic Game Solving (CHC, AK, ML, CB), pp. 258–261.
STOCSTOC-2011-HansenKLMT #algorithm #game studies #probability
Exact algorithms for solving stochastic games: extended abstract (KAH, MK, NL, PBM, EPT), pp. 205–214.
STOCSTOC-2011-KhotM #approximate #equation #linear #np-hard
NP-hardness of approximately solving linear equations over reals (SK, DM), pp. 413–420.
DLTDLT-2011-DiekertM #infinity #problem #word
Solving Word Problems in Group Extensions over Infinite Words (VD, AGM), pp. 192–203.
ICALPICALP-v1-2011-DingX #clustering #problem
Solving the Chromatic Cone Clustering Problem via Minimum Spanning Sphere (HD, JX), pp. 773–784.
FMFM-2011-GhaziT #reasoning #relational #smt
Relational Reasoning via SMT Solving (AAEG, MT), pp. 133–148.
CHICHI-2011-KandoganKMP #how #interface #problem
How a freeform spatial interface supports simple problem solving tasks (EK, JK, TPM, PP), pp. 925–934.
ICEISICEIS-v2-2011-Ng #framework #problem
Problem Solving Framework within Decision Support Systems (YHN), pp. 140–146.
ICEISICEIS-v2-2011-Santibanez-GonzalezLM #algorithm #design #problem #search-based
A Genetic Algorithm for Solving a Public Sector Sustainable Supply Chain Design Problem (EDRSG, HPLL, GRM), pp. 222–227.
SEKESEKE-2011-Zhang #heuristic #problem
Inconsistency-Induced Heuristics for Problem Solving (DZ), pp. 137–142.
ECMFAECMFA-2011-DouxABCFL #approach #eclipse #framework #problem
An MDE-Based Approach for Solving Configuration Problems: An Application to the Eclipse Platform (GD, PA, GB, JC, MDDF, SUJL), pp. 160–171.
TOOLSTOOLS-EUROPE-2011-KuhlmannHG #modelling #ocl #satisfiability #validation
Extensive Validation of OCL Models by Integrating SAT Solving into USE (MK, LH, MG), pp. 290–306.
SACSAC-2011-KienHB #algorithm #communication #hybrid #problem #search-based
New hybrid genetic algorithm for solving optimal communication spanning tree problem (PTK, NDH, HTTB), pp. 1076–1081.
SACSAC-2011-Thierry #approach #constraints #geometry
A particle-spring approach to geometric constraints solving (SEBT), pp. 1100–1105.
CADECADE-2011-JovanovicM #integer #linear
Cutting to the Chase Solving Linear Integer Arithmetic (DJ, LMdM), pp. 338–353.
CADECADE-2011-KorovinV #bound #linear
Solving Systems of Linear Inequalities by Bound Propagation (KK, AV), pp. 369–383.
ISSTAISSTA-2011-PasareanuRV #execution #symbolic computation
Symbolic execution with mixed concrete-symbolic solving (CSP, NR, WV), pp. 34–44.
ICSTSAT-2011-GableskeH #named #random #satisfiability #using
EagleUP: Solving Random 3-SAT Using SLS with Unit Propagation (OG, MH), pp. 367–368.
ICSTSAT-2011-Minato #diagrams #named #performance #permutation #problem
πDD: A New Decision Diagram for Efficient Problem Solving in Permutation Space (SiM), pp. 90–104.
ICSTSAT-2011-MundhenkZ #equivalence #how #normalisation
How to Apply SAT-Solving for the Equivalence Test of Monotone Normal Forms (MM, RZ), pp. 105–119.
ASEASE-2010-HooimeijerW #constraints #string
Solving string constraints lazily (PH, WW), pp. 377–386.
ASEASE-2010-TrezentosLO #dependence #named #optimisation #problem #pseudo #using
Apt-pbo: solving the software dependency problem using pseudo-boolean optimization (PT, IL, ALO), pp. 427–436.
DACDAC-2010-NSRKALPST #problem #question #variability
Who solves the variability problem? (NN, JCR, JK, RCA, CL, VP, AJS, ST), pp. 218–219.
ITiCSEITiCSE-2010-KiesmullerSBR #identification #online #pattern matching #pattern recognition #problem #recognition #using
Online identification of learner problem solving strategies using pattern recognition methods (UK, SS, TB, KR), pp. 274–278.
STOCSTOC-2010-BurgisserC #equation #polynomial #problem
Solving polynomial equations in smoothed polynomial time and a near solution to smale’s 17th problem (PB, FC), pp. 503–512.
FLOPSFLOPS-2010-HoweK #prolog #satisfiability
A Pearl on SAT Solving in Prolog (JMH, AK), pp. 165–174.
FLOPSFLOPS-2010-TamuraTB #constraints #problem #satisfiability
Solving Constraint Satisfaction Problems with SAT Technology (NT, TT, MB), pp. 19–23.
LATALATA-2010-BalanS #incremental #problem
Incremental Building in Peptide Computing to Solve Hamiltonian Path Problem (MSB, PS), pp. 549–560.
ICGTICGT-2010-OrejasL #constraints #graph transformation #theorem proving
Delaying Constraint Solving in Symbolic Graph Transformation (FO, LL), pp. 43–58.
CHICHI-2010-WangZC #gesture #mobile #named #predict #problem
SHRIMP: solving collision and out of vocabulary problems in mobile predictive input with motion gesture (JW, SZ, JFC), pp. 15–24.
CIKMCIKM-2010-ZaragozaCB #question #ranking #web
Web search solved?: all result rankings the same? (HZ, BBC, RABY), pp. 529–538.
KMISKMIS-2010-SultanowWL #communication
Solve Insufficient Communications — A Measurement-method for Satisfied Communication in Business Organizations (ES, EW, RL), pp. 367–371.
ECMFAECMFA-2010-KleinerFA #automation #constraints #formal method #theorem proving
Model Search: Formalizing and Automating Constraint Solving in MDE Platforms (MK, MDDF, PA), pp. 173–188.
RERE-2010-MaidenJKNZM #idea #problem #requirements #research
Requirements Engineering as Creative Problem Solving: A Research Agenda for Idea Finding (NAMM, SJ, IKK, RN, KZ, AM), pp. 57–66.
RERE-2010-SalinesiMDD #constraints #integer #requirements #reuse #theorem proving #using
Using Integer Constraint Solving in Reuse Based Requirements Engineering (CS, RM, DD, OD), pp. 243–251.
SACSAC-2010-RiponGHT #approach #layout #multi #problem #using
Multi-objective evolutionary approach for solving facility layout problem using local search (KSNR, KG, MH, JT), pp. 1155–1156.
SACSAC-2010-ToledoOOP #algorithm #parallel #problem #scheduling #search-based
Parallel genetic algorithm approaches applied to solve a synchronized and integrated lot sizing and scheduling problem (CFMT, LdO, RRRdO, MRP), pp. 1148–1152.
ICSEICSE-2010-Ma #analysis #constraints #testing #theorem proving
Constraint solving techniques for software testing and analysis (FM), pp. 417–420.
CAVCAV-2010-Rybalchenko #constraints #theorem proving #theory and practice #verification
Constraint Solving for Program Verification: Theory and Practice by Example (AR), pp. 57–71.
CSLCSL-2010-Rybalchenko #constraints #theorem proving #theory and practice #verification
Constraint Solving for Program Verification: Theory and Practice by Example (AR), p. 51.
ICLPICLP-2010-FayruzovJVCC10 #performance #set #source code
Efficient Solving of Time-dependent Answer Set Programs (TF, JJ, DV, CC, MDC), pp. 64–73.
ICLPICLP-2010-ShakarianSS10 #network #optimisation #problem #social #source code #using
Using Generalized Annotated Programs to Solve Social Network Optimization Problems (PS, VSS, MLS), pp. 182–191.
ICLPICLP-J-2010-DrescherW #approach #constraints #set
A translational approach to constraint answer set solving (CD, TW), pp. 465–480.
ICSTICST-2010-JobstlWAW #consistency #execution #smt #symbolic computation #testing
When BDDs Fail: Conformance Testing with Symbolic Execution and SMT Solving (EJ, MW, BKA, FW), pp. 479–488.
ICTSSICTSS-2010-LakhotiaTHH #constraints #execution #float #named #search-based #symbolic computation #theorem proving
FloPSy — Search-Based Floating Point Constraint Solving for Symbolic Execution (KL, NT, MH, JdH), pp. 142–157.
ICSTSAT-2010-BofillSV #constraints #problem #smt
A System for Solving Constraint Satisfaction Problems with SMT (MB, JS, MV), pp. 300–305.
ICSTSAT-2010-Ehlers #automaton #satisfiability #using
Minimising Deterministic Büchi Automata Precisely Using SAT Solving (RE), pp. 326–332.
ICSTSAT-2010-GoultiaevaB
Exploiting Circuit Representations in QBF Solving (AG, FB), pp. 333–339.
ICSTSAT-2010-Kottler #satisfiability
SAT Solving with Reference Points (SK), pp. 143–157.
ICSTSAT-2010-LiMQZ #satisfiability
Exact MinSAT Solving (CML, FM, ZQ, ZZ), pp. 363–368.
ICSTSAT-2010-TompkinsH #satisfiability
Dynamic Scoring Functions with Variable Expressions: New SLS Methods for Solving SAT (DADT, HHH), pp. 278–292.
DACDAC-2009-JainC #graph #performance #satisfiability #using
Efficient SAT solving for non-clausal formulas using DPLL, graphs, and watched cuts (HJ, EMC), pp. 563–568.
DATEDATE-2009-ChambersMV #generative #performance #satisfiability
Faster SAT solving with better CNF generation (BC, PM, DV), pp. 1590–1595.
ITiCSEITiCSE-2009-KiesmullerB #algorithm #automation #identification #problem
Automatically identifying learners’ problem solving strategies in-process solving algorithmic problems (UK, TB), p. 354.
ESOPESOP-2009-YuanE #algorithm #performance #problem #reachability
An Efficient Algorithm for Solving the Dyck-CFL Reachability Problem on Trees (HY, PTE), pp. 175–189.
TACASTACAS-2009-BerwangerCWDH #game studies #named
Alpaga: A Tool for Solving Parity Games with Imperfect Information (DB, KC, MDW, LD, TAH), pp. 58–61.
HCIHCD-2009-NieminenT #concept #development #problem
Concept Development with Real Users: Involving Customers in Creative Problem Solving (MPN, MT), pp. 869–878.
AdaSIGAda-2009-Barkstrom #ada #algorithm #concurrent #multi #on the #problem #using
On using Ada to solve problems in computational economics and related disciplines with concurrent, multiagent algorithms (BRB), pp. 61–72.
ICEISICEIS-HCI-2009-SantosRG #collaboration #problem
Integrating VR in an Engineering Collaborative Problem Solving Environment (IHFdS, AR, MG), pp. 124–129.
ICEISICEIS-ISAS-2009-FerriniB #approach #policy
A Comprehensive Approach for Solving Policy Heterogeneity (RF, EB), pp. 63–68.
ICMTICMT-2009-PetterBM #constraints #model transformation
Solving Constraints in Model Transformations (AP, AB, MM), pp. 132–147.
SACSAC-2009-YangLLW #approach #approximate #constraints #theorem proving
An approximate approach to constraint solving in soft sensing (TY, ZL, XL, HW), pp. 1415–1416.
PPoPPPPoPP-2009-Quintana-OrtiIQG #hardware #linear #multi
Solving dense linear systems on platforms with multiple hardware accelerators (GQO, FDI, ESQO, RAvdG), pp. 121–130.
CADECADE-2009-BorrallerasLNRR #linear #polynomial #satisfiability
Solving Non-linear Polynomial Arithmetic via SAT Modulo Linear Arithmetic (CB, SL, RNM, ERC, AR), pp. 294–305.
CAVCAV-2009-DilligDA #integer #linear #proving
Cuts from Proofs: A Complete and Practical Technique for Solving Linear Inequalities over Integers (ID, TD, AA), pp. 233–247.
CAVCAV-2009-WintersteigerHM #approach #concurrent #smt
A Concurrent Portfolio Approach to SMT Solving (CMW, YH, LMdM), pp. 715–720.
ICLPICLP-2009-GebserOS #constraints #set
Constraint Answer Set Solving (MG, MO, TS), pp. 235–249.
ICLPICLP-2009-Li #algorithm #constraints #difference #functional #integer #research #summary
Research Summary: Extending Elimination Algorithms for Functional Constraints to Solve Two Integer Variables per Inequality (CL), pp. 530–531.
ICSTSAT-2009-AnsoteguiBL #satisfiability #testing
Solving (Weighted) Partial MaxSAT through Satisfiability Testing (CA, MLB, JL), pp. 427–440.
ICSTSAT-2009-JohannsenRW #satisfiability #strict
Solving SAT for CNF Formulas with a One-Sided Restriction on Variable Occurrences (DJ, IR, MW), pp. 80–85.
ICSTSAT-2009-LewisMSNBG #distributed #named
PaQuBE: Distributed QBF Solving with Advanced Knowledge Sharing (MDTL, PM, TS, MN, BB, EG), pp. 509–523.
ICSTSAT-2009-Vardi #satisfiability
Symbolic Techniques in Propositional Satisfiability Solving (MYV), pp. 2–3.
TAPTAP-2009-CalvagnaG #combinator #heuristic #interactive #satisfiability #testing
Combining Satisfiability Solving and Heuristics to Constrained Combinatorial Interaction Testing (AC, AG), pp. 27–42.
FATESTestCom-FATES-2009-GrieskampQWKC #constraints #interactive #smt #theorem proving
Interaction Coverage Meets Path Coverage by SMT Constraint Solving (WG, XQ, XW, NK, MBC), pp. 97–112.
VMCAIVMCAI-2009-TalyGT #constraints #logic #theorem proving #using
Synthesizing Switching Logic Using Constraint Solving (AT, SG, AT), pp. 305–319.
CASECASE-2008-CamponogaraP #generative #problem #scheduling
Column generation for solving a compressor scheduling problem (EC, AP), pp. 796–801.
CASECASE-2008-TeoP #heuristic #hybrid #layout #problem
A hybrid ACO/PSO heuristic to solve single row layout problem (YTT, SGP), pp. 597–602.
DACDAC-2008-LeeJH #satisfiability #scalability
Bi-decomposing large Boolean functions via interpolation and satisfiability solving (RRL, JHRJ, WLH), pp. 636–641.
ITiCSEITiCSE-2008-KiesmullerB #algorithm #analysis #how #problem
How do 7th graders solve algorithmic problems?: a tool-based analysis (UK, TB), p. 353.
FoSSaCSFoSSaCS-2008-GimbertH #game studies #probability #random
Simple Stochastic Games with Few Random Vertices Are Easy to Solve (HG, FH), pp. 5–19.
PLDIPLDI-2008-GulwaniSV #constraints #program analysis #theorem proving
Program analysis as constraint solving (SG, SS, RV), pp. 281–292.
PLDIPLDI-2008-PereiraP
Register allocation by puzzle solving (FMQP, JP), pp. 216–226.
SASSAS-2008-LalR #data flow #multi #query #using
Solving Multiple Dataflow Queries Using WPDSs (AL, TWR), pp. 93–109.
FLOPSFLOPS-2008-MellarkodG #constraints #reasoning #set #theorem proving
Integrating Answer Set Reasoning with Constraint Solving Techniques (VSM, MG), pp. 15–31.
ICMLICML-2008-KumarT #estimation
Efficiently solving convex relaxations for MAP estimation (MPK, PHST), pp. 680–687.
KRKR-2008-DrescherGGKKOS #set
Conflict-Driven Disjunctive Answer Set Solving (CD, MG, TG, BK, AK, MO, TS), pp. 422–432.
PPDPPPDP-2008-SchulteS
Dynamic variable elimination during propagation solving (CS, PJS), pp. 247–257.
SACSAC-2008-Djelloul #constraints #first-order
Combination of decomposability and propagation for solving first-order constraints in decomposable theories (KD), pp. 1728–1732.
SACSAC-2008-FabreS
Combining symbolic and numerical solvers to simplify indecomposable systems solving (AF, PS), pp. 1838–1842.
SPLCSPLC-2008-SaraburaB #challenge #development #product line #requirements
Solving Requirements Management Challenges in Product Line Development (MS, PB), p. 352.
CSLCSL-2008-Schewe #algorithm #game studies
An Optimal Strategy Improvement Algorithm for Solving Parity and Payoff Games (SS), pp. 369–384.
ICLPICLP-2008-Triska #constraints #finite #theorem proving
Generalising Constraint Solving over Finite Domains (MT), pp. 820–821.
ISSTAISSTA-2008-ElkarabliehMK #constraints #performance
Efficient solving of structural constraints (BE, DM, SK), pp. 39–50.
ICSTSAT-2008-DavisTYZ #design #hardware #performance #satisfiability
Designing an Efficient Hardware Implication Accelerator for SAT Solving (JDD, ZT, FY, LZ), pp. 48–62.
ICSTSAT-2008-HaimW #estimation #online #runtime #satisfiability
Online Estimation of SAT Solving Runtime (SH, TW), pp. 133–138.
ICSTSAT-2008-LonsingB #named
Nenofex: Expanding NNF for QBF Solving (FL, AB), pp. 196–210.
CASECASE-2007-GuHSX #assembly #estimation #problem
Assembly Line Balancing Problems Solved by Estimation of Distribution (LG, SH, AS, XX), pp. 123–127.
CASECASE-2007-NishiHI #problem #scheduling
A Successive Lagrangian Relaxation Method for Solving Flowshop Scheduling Problems with Total Weighted Tardiness (TN, YH, MI), pp. 875–880.
CASECASE-2007-YogeswaranPT #algorithm #heuristic #hybrid #problem #search-based #using
An hybrid heuristic using genetic algorithm and simulated annealing algorithm to solve machine loading problem in FMS (MY, SGP, MKT), pp. 182–187.
HTHT-2007-MelguizoOJ #navigation #predict #problem #web
Predicting and solving web navigation problems (MCPM, HvO, IJ), pp. 47–48.
ITiCSEITiCSE-2007-ByrdCCKK #problem #student
Solving recurring student problems with recurrences (JB, MC, DC, PK, MJK), p. 343.
ITiCSEITiCSE-2007-ChinnSM #algorithm #data type #performance #problem #student
Problem solving and student performance in data structures and algorithms (DDC, CS, KM), pp. 241–245.
WRLAWRLA-2006-Santos-GarciaP07
Solving Sudoku Puzzles with Rewriting Rules (GSG, MP), pp. 79–93.
LISPILC-2007-Frank #constraints #lisp #theorem proving
Constraint solving in common Lisp (SF), p. 10.
HCIHCI-MIE-2007-BaranDC #approach #eye tracking #how #problem
How Do Adults Solve Digital Tangram Problems? Analyzing Cognitive Strategies Through Eye Tracking Approach (BB, BD, ), pp. 555–563.
ICEISICEIS-AIDSS-2007-CastroO #distributed #multi #problem
A Distributed Multi-Agent System to Solve Airline Operations Problems (AJMC, EO), pp. 22–30.
ICEISICEIS-AIDSS-2007-CrawfordLCP #approach #set
A Evolutionary Approach to Solve Set Covering (BC, CL, CC, FP), pp. 356–363.
ICEISICEIS-J-2007-CastroO07a #distributed #multi #problem #using
Solving Airline Operations Problems Using Specialized Agents in a Distributed Multi-Agent System (AJMC, ECO), pp. 173–184.
ICEISICEIS-SAIC-2007-ZarembaVMBCCVFT #challenge #comparison #semantics #towards #web #web service
Towards Semantic Interoperabilty — In-depth Comparison of Two Approaches to Solving Semantic Web Service Challenge Mediation Tasks (MZ, TV, MM, MB, SC, DC, EDV, FMF, CT), pp. 413–421.
ICMLICML-2007-BordesBGW #multi
Solving multiclass support vector machines with LaRank (AB, LB, PG, JW), pp. 89–96.
ICMLICML-2007-SternHG #game studies #learning
Learning to solve game trees (DHS, RH, TG), pp. 839–846.
SACSAC-2007-KunXY #algorithm #constraints #geometry #parallel #theorem proving
Parallel algorithms on geometric constraint solving (KJ, YG, XL, YZ), pp. 778–779.
SACSAC-2007-MouhoubS #constraints #problem
Solving conditional and composite constraint satisfaction problems (MM, AS), pp. 336–337.
HPDCHPDC-2007-MaassenB #grid #named #problem
Smartsockets: solving the connectivity problems in grid computing (JM, HEB), pp. 1–10.
SMTSMT-J-2006-GanaiTG07 #difference #encoding #integration #lazy evaluation #logic #named
SDSAT: Tight Integration of Small Domain Encoding and Lazy Approaches in Solving Difference Logic (MKG, MT, AG), pp. 91–114.
SMTSMT-J-2006-SeshiaSB07 #constraints #on the
On Solving Boolean Combinations of UTVPI Constraints (SAS, KS, REB), pp. 67–90.
CADECADE-2007-GeBT #modulo theories #quantifier #satisfiability #using #verification
Solving Quantified Verification Conditions Using Satisfiability Modulo Theories (YG, CB, CT), pp. 167–182.
LICSLICS-2007-Hales #geometry #problem
Some Methods of Problem Solving in Elementary Geometry (TCH), pp. 35–40.
ICSTSAT-2007-FuhsGMSTZ #analysis #polynomial #satisfiability #termination
SAT Solving for Termination Analysis with Polynomial Interpretations (CF, JG, AM, PSK, RT, HZ), pp. 340–354.
ICSTSAT-2007-LukasiewyczGHT #multi #problem #pseudo
Solving Multi-objective Pseudo-Boolean Problems (ML, MG, CH, JT), pp. 56–69.
ICSTSAT-2007-SamulowitzB #clustering
Dynamically Partitioning for Solving QBF (HS, FB), pp. 215–229.
VMCAIVMCAI-2007-RybalchenkoS #constraints #theorem proving
Constraint Solving for Interpolation (AR, VSS), pp. 346–362.
CASECASE-2006-CapachoPGD #assembly #heuristic #problem
Heuristic Methods to Solve the Alternative Subgraphs Assembly Line Balancing Problem (LC, RP, OG, AD), pp. 501–506.
DocEngDocEng-2006-HurstMA #layout #problem
Solving the simple continuous table layout problem (NH, KM, DWA), pp. 28–30.
ITiCSEITiCSE-2006-ChenWHL #algorithm #benchmark #design #metric #problem
Design and applications of an algorithm benchmark system in a computational problem solving environment (MYC, JDW, JHH, DTL), pp. 123–127.
PEPMPEPM-2006-LucaAAK #program transformation
Program transformation by solving recurrences (BL, SA, HA, SCK), pp. 121–129.
STOCSTOC-2006-Plandowski #algorithm #equation #performance #word
An efficient algorithm for solving word equations (WP), pp. 467–476.
ICMLICML-2006-ToussaintS #markov #probability #process
Probabilistic inference for solving discrete and continuous state Markov Decision Processes (MT, AJS), pp. 945–952.
ICPRICPR-v2-2006-ZhengYYW #classification #effectiveness #image #problem
Effective classification image space which can solve small sample size problem (YJZ, JYY, JY, XW), pp. 861–864.
ICPRICPR-v4-2006-ChaoTWC #framework #kernel #problem #testing #verification
A Kernel-based Discrimination Framework for Solving Hypothesis Testing Problems with Application to Speaker Verification (YHC, WHT, HMW, RCC), pp. 229–232.
PADLPADL-2006-BecketBMSSW #constraints #theorem proving
Adding Constraint Solving to Mercury (RB, MJGdlB, KM, ZS, PJS, MW), pp. 118–133.
PADLPADL-2006-QuesadaRDC #problem #using
Using Dominators for Solving Constrained Path Problems (LQ, PVR, YD, RC), pp. 73–87.
SACSAC-2006-CutelloNO #algorithm #analysis #heuristic
Analysis of an evolutionary algorithm with HyperMacromutation and stop at first constructive mutation heuristic for solving trap functions (VC, GN, PSO), pp. 945–949.
SACSAC-2006-DjelloulD #constraints #finite #first-order #formal method #infinity
Solving first-order constraints in the theory of finite or infinite trees: introduction to the decomposable theories (KD, TBHD), pp. 7–14.
SACSAC-2006-PavonDL #constraints #geometry #problem #theorem proving
An adjustment model in a geometric constraint solving problem (RP, FD, MVL), pp. 968–973.
SACSAC-2006-SinghXMH #geometry #linear #locality #problem #programming #using
Solving the brachytherapy seed localization problem using geometric and linear programming techniques (VS, LM, JX, KRH), pp. 229–234.
SACSAC-2006-ZhangG #composition #constraints #geometry #graph #theorem proving
Spatial geometric constraint solving based on k-connected graph decomposition (GFZ, XSG), pp. 979–983.
HPDCHPDC-2006-DjerrahCCR #bound #framework #optimisation #problem
Bob++: Framework for Solving Optimization Problems with Branch-and-Bound methods (AD, BLC, VDC, CR), pp. 369–370.
CSLCSL-2006-HenzingerP #game studies
Solving Games Without Determinization (TAH, NP), pp. 395–410.
ICLPICLP-2006-Brain #declarative #problem #semantics #set #using
Declarative Problem Solving Using Answer Set Semantics (MB), pp. 459–460.
ICLPICLP-2006-DaoD #constraints #first-order #formal method
Solving First-Order Constraints in the Theory of the Evaluated Trees (TBHD, KD), pp. 423–424.
IJCARIJCAR-2006-LahiriM #constraints #linear
Solving Sparse Linear Constraints (SKL, MM), pp. 468–482.
RTARTA-2006-CodishLS #constraints #partial order #termination
Solving Partial Order Constraints for LPO Termination (MC, VL, PJS), pp. 4–18.
RTARTA-2006-Salvati #equation #linear #type system #λ-calculus
Syntactic Descriptions: A Type System for Solving Matching Equations in the Linear λ-Calculus (SS), pp. 151–165.
ICSTSAT-2006-DantsinW #constant #performance #satisfiability
MAX-SAT for Formulas with Constant Clause Density Can Be Solved Faster Than in O(s2) Time (ED, AW), pp. 266–276.
ICSTSAT-2006-FuM #on the #problem #satisfiability
On Solving the Partial MAX-SAT Problem (ZF, SM), pp. 252–265.
ICSTSAT-2006-HyvarinenJN #satisfiability
A Distribution Method for Solving SAT in Grids (AEJH, TAJ, IN), pp. 430–435.
ICSTSAT-2006-JussilaSB #proving #quantifier #satisfiability
Extended Resolution Proofs for Symbolic SAT Solving with Quantification (TJ, CS, AB), pp. 54–60.
ICSTSAT-2006-NishimuraRS #satisfiability #using
Solving #SAT Using Vertex Covers (NN, PR, SS), pp. 396–409.
ICSTSAT-2006-TangM #quantifier
Solving Quantified Boolean Formulas with Circuit Observability Don’t Cares (DT, SM), pp. 368–381.
CASECASE-2005-TanonkouBBX #approach #probability #problem #using
Solving a stochastic inventory-location problem using Lagrangian relaxation approach (GAT, LB, RB, XX), pp. 279–284.
DACDAC-2005-BabicBH #performance #satisfiability
Efficient SAT solving: beyond supercubes (DB, JDB, AJH), pp. 744–749.
DACDAC-2005-LiSB #bound #effectiveness #problem
Effective bounding techniques for solving unate and binate covering problems (XYL, MFMS, FB), pp. 385–390.
ITiCSEITiCSE-2005-MullerH #algorithm #guidelines #multi #object-oriented #problem
Guidelines for a multiple-goal CS introductory course: algorithmic problem-solving woven into OOP (OM, BH), p. 356.
ITiCSEITiCSE-2005-WeirVMN #education #how #java
Difficulties teaching Java in CS1 and how we aim to solve them (GRSW, TV, AJM, MN), pp. 344–345.
FASEFASE-2005-CaneteM #ontology #problem #re-engineering #towards
Towards a Theory on the Role of Ontologies in Software Engineering Problem Solving (JMC, FJGM), pp. 205–219.
FoSSaCSFoSSaCS-2005-SchaeferV #component #composition #refinement
Component Refinement and CSC Solving for STG Decomposition (MS, WV), pp. 348–363.
ICALPICALP-2005-DelzannoG #composition #constraints #process #theorem proving #verification
Compositional Verification of Asynchronous Processes via Constraint Solving (GD, MG), pp. 1239–1250.
ICEISICEIS-v2-2005-Hakansson #comprehension #problem
Transferring Problem Solving Strategies from the Expert to the End Users — Supporting Understanding (AH), pp. 3–10.
PADLPADL-2005-Almendros-JimenezC #constraints #set
Solving Constraints on Sets of Spatial Objects (JMAJ, AC), pp. 158–173.
PADLPADL-2005-Munoz-HernandezG #collaboration #fuzzy #problem
Solving Collaborative Fuzzy Agents Problems with CLP(FD) (SMH, JMGP), pp. 187–202.
SACSAC-2005-Goualard #algorithm #constraints #on the #theorem proving
On considering an interval constraint solving algorithm as a free-steering nonlinear Gauss-Seidel procedure (FG), pp. 1434–1438.
SACSAC-2005-Hosobe #constraints #documentation #layout #linear #web
Solving linear and one-way constraints for web document layout (HH), pp. 1252–1253.
SACSAC-2005-LambertMS #constraints #using
Solving strategies using a hybridization model for local search and constraint propagation (TL, EM, FS), pp. 398–403.
SACSAC-2005-LauW #approach #multi #optimisation #problem
A multi-agent approach for solving optimization problems involving expensive resources (HCL, HW), pp. 79–83.
ICSTSAT-J-2004-PanV05 #satisfiability
Search vs. Symbolic Techniques in Satisfiability Solving (GP, MYV), pp. 235–250.
ICLPICLP-2005-BaseliceBG #constraints #integration #set #theorem proving #towards
Towards an Integration of Answer Set and Constraint Solving (SB, PAB, MG), pp. 52–66.
ICSTSAT-2005-ArgelichM #problem #satisfiability
Solving Over-Constrained Problems with SAT Technology (JA, FM), pp. 1–15.
ICSTSAT-2005-SheiniS #integer #linear #logic #satisfiability #scalability
A Scalable Method for Solving Satisfiability of Integer Linear Arithmetic Logic (HMS, KAS), pp. 241–256.
ICSTSAT-2005-Wahlstrom #performance #satisfiability
Faster Exact Solving of SAT Formulae with a Low Number of Occurrences per Variable (MW), pp. 309–323.
DACDAC-2004-BaneresCK #paradigm #recursion
A recursive paradigm to solve Boolean relations (DB, JC, MK), pp. 416–421.
DACDAC-2004-MeiRCHD #performance #robust
Robust, stable time-domain methods for solving MPDEs of fast/slow systems (TM, JSR, TSC, SAH, DMD), pp. 848–853.
DATEDATE-v1-2004-CatthoorCMGLMSW #design #how #problem #question #scalability
How Can System-Level Design Solve the Interconnect Technology Scaling Problem? (FC, AC, GM, PG, RL, KM, PvdS, RW), pp. 332–339.
DATEDATE-v1-2004-WedlerSK #reasoning #satisfiability
Arithmetic Reasoning in DPLL-Based SAT Solving (MW, DS, WK), pp. 30–35.
ITiCSEITiCSE-2004-AlfonsiSPS #named #problem
IT4PS: information technology for problem solving (CRA, NS, DP, MS), p. 241.
ITiCSEITiCSE-2004-MullerHA #problem
(An almost) pedagogical pattern for pattern-based problem-solving instruction (OM, BH, HA), pp. 102–106.
ITiCSEITiCSE-2004-PaciniFF #database #learning #problem #spreadsheet #tool support
Learning problem solving with spreadsheet and database tools (GP, GF, AF), p. 267.
TACASTACAS-2004-GrooteK #equation #fixpoint
Solving Disjunctive/Conjunctive Boolean Equation Systems with Alternating Fixed Points (JFG, MK), pp. 436–450.
TACASTACAS-2004-LingerS #analysis #constraints #ml #theorem proving #type inference
Binding-Time Analysis for MetaML via Type Inference and Constraint Solving (NL, TS), pp. 266–279.
STOCSTOC-2004-BienstockI #problem
Solving fractional packing problems in Oast(1/?) iterations (DB, GI), pp. 146–155.
STOCSTOC-2004-DunaganV #algorithm #linear #polynomial #source code
A simple polynomial-time rescaling algorithm for solving linear programs (JD, SV), pp. 315–320.
STOCSTOC-2004-SpielmanT #algorithm #clustering #graph #linear
Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems (DAS, SHT), pp. 81–90.
ICALPICALP-2004-DabrowskiP #equation #word
Solving Two-Variable Word Equations (Extended Abstract) (RD, WP), pp. 408–419.
SEFMSEFM-2004-ZhangXW #constraints #execution #generative #symbolic computation #testing #theorem proving #using
Path-Oriented Test Data Generation Using Symbolic Execution and Constraint Solving Techniques (JZ, CX, XW), pp. 242–250.
ICEISICEIS-v4-2004-RoqueOL #framework #transaction
Solving Transactional Control in Current Management Frameworks (VR, JLO, RPL), pp. 523–526.
ICMLICML-2004-FernB #clustering #graph #problem
Solving cluster ensemble problems by bipartite graph partitioning (XZF, CEB).
ICMLICML-2004-Zhang #algorithm #linear #predict #probability #problem #scalability #using
Solving large scale linear prediction problems using stochastic gradient descent algorithms (TZ0).
ICPRICPR-v4-2004-HabedB #approach #constraints #self
Camera Self-Calibration: A New Approach for Solving the Modulus Constraint (AH, BB), pp. 116–119.
KRKR-2004-GrootTH #analysis #approximate #case study #classification #problem #towards
Towards a Structured Analysis of Approximate Problem Solving: A Case Study in Classification (PG, AtT, FvH), pp. 399–406.
SEKESEKE-2004-CairoA #architecture #problem #reuse
The KAMET II Architecture for Problem-Solving Method Reuse (OC, JCA), pp. 435–438.
LOPSTRLOPSTR-2004-Colon #constraints #imperative #source code #synthesis #theorem proving
Schema-Guided Synthesis of Imperative Programs by Constraint Solving (MC), pp. 166–181.
SACSAC-2004-AlbaC #fault #heuristic #hybrid #parallel #problem
Solving the error correcting code problem with parallel hybrid heuristics (EA, JFC), pp. 985–989.
SACSAC-2004-BoughaciD #metaheuristic #optimisation #problem #satisfiability #using
Solving weighted Max-Sat optimization problems using a Taboo Scatter Search metaheuristic (DB, HD), pp. 35–36.
SACSAC-2004-CaldeiraMR #algorithm #hybrid #problem #using
Using a hybrid Evolutionary-Taboo Algorithm to solve Job Shop Problem (JPC, FM, ACR), pp. 1446–1451.
SACSAC-2004-GuptaCH #constraints #linear
Experiments with UNA for solving linear constraints in real variables (NG, YC, MZH), pp. 1013–1020.
SACSAC-2004-KatayamaHN #clique #problem
Solving the maximum clique problem by k-opt local search (KK, AH, HN), pp. 1021–1025.
CAVCAV-2004-KroeningOSS #satisfiability
Abstraction-Based Satisfiability Solving of Presburger Arithmetic (DK, JO, SAS, OS), pp. 308–320.
ICLPICLP-2004-Schrijvers #generative #java #memory management #named #prolog
JmmSolve: A Generative Java Memory Model Implemented in Prolog and CHR (TS), pp. 475–476.
IJCARIJCAR-2004-Weispfenning #constraints
Solving Constraints by Elimination Methods (VW), pp. 336–341.
SATSAT-2004-LewisSB #detection #satisfiability
Early Conflict Detection Based BCP for SAT Solving (MDTL, TS, BB), pp. 29–36.
SATSAT-2004-PanV #satisfiability
Search vs. Symbolic Techniques in Satisfiability Solving (GP, MYV), pp. 137–146.
SATSAT-2004-ThiffaultBW
Solving Non-clausal Formulas with DPLL search (CT, FB, TW), pp. 147–156.
DACDAC-2003-LuWCMH #case study #correlation #industrial
A signal correlation guided ATPG solver and its applications for solving difficult industrial cases (FL, LCW, KTC, JM, ZH), pp. 436–441.
DACDAC-2003-NgPMJ #industrial #problem
Solving the latch mapping problem in an industrial setting (KN, MRP, RM, JJ), pp. 442–447.
SIGMODSIGMOD-2003-GuptaLM #named #problem #semantics
BIRN-M: A Semantic Mediator for Solving Real-World Neuroscience Problems (AG, BL, MEM), p. 678.
ICSMEICSM-2003-Mitchell #approach #clustering #heuristic #problem
A Heuristic Approach to Solving the Software Clustering Problem (BSM), pp. 285–288.
ICALPICALP-2003-CieliebakFPS #problem
Solving the Robots Gathering Problem (MC, PF, GP, NS), pp. 1181–1196.
ICEISICEIS-v1-2003-MorochoSP #database #named #ontology #semantics
Ontologies: Solving Semantic Heterogeneity in a Federated Spatial Database System (VM, FS, LPV), pp. 347–352.
ICMLICML-2003-Graepel #difference #equation #linear #process
Solving Noisy Linear Operator Equations by Gaussian Processes: Application to Ordinary and Partial Differential Equations (TG), pp. 234–241.
PADLPADL-2003-FernandezHS #combinator #constraints #functional #logic #problem
Solving Combinatorial Problems with a Constraint Functional Logic Language (AJF, MTHG, FSP), pp. 320–338.
PADLPADL-2003-TomasL #generative
A CLP-Based Tool for Computer Aided Generation and Solving of Maths Exercises (APT, JPL), pp. 223–240.
SACSAC-2003-Zoeteweij #constraints #coordination #distributed #theorem proving
Coordination-Based Distributed Constraint Solving in DICE (PZ), pp. 360–366.
CAVCAV-2003-ColonSS #constraints #generative #invariant #linear #theorem proving #using
Linear Invariant Generation Using Non-linear Constraint Solving (MC, SS, HS), pp. 420–432.
LICSLICS-2003-Comon-LundhS #constraints #deduction #theorem proving
Intruder Deductions, Constraint Solving and Insecurity Decision in Presence of Exclusive or (HCL, VS), p. 271–?.
ICSTSAT-2003-Bruni #fault #satisfiability #scalability #set
Solving Error Correction for Large Data Sets by Means of a SAT Solver (RB), pp. 229–241.
DACDAC-2002-AloulRMS #satisfiability #symmetry
Solving difficult SAT instances in the presence of symmetry (FAA, AR, ILM, KAS), pp. 731–736.
DACDAC-2002-AnderssonBCH #approach #automation #design #problem #proving
A proof engine approach to solving combinational design automation problems (GA, PB, BC, ZH), pp. 725–730.
DATEDATE-2002-FerrandiRS #constraints #functional #theorem proving #using #verification
Functional Verification for SystemC Descriptions Using Constraint Solving (FF, MR, DS), pp. 744–751.
STOCSTOC-2002-BertsimasV #random #source code
Solving convex programs by random walks (DB, SV), pp. 109–115.
FLOPSFLOPS-2002-Garcia-DiazN #constraints #quantifier
Solving Mixed Quantified Constraints over a Domain Based on Real Numbers and Herbrand Terms (MGD, SN), pp. 103–118.
ICALPICALP-2002-BrodalLOP #problem #statistics #string
Solving the String Statistics Problem in Time O(n log n) (GSB, RBL, , CNSP), pp. 728–739.
ICPRICPR-v2-2002-ChengWHT #approach #equation #self
A New Approach to Solving Kruppa Equations for Camera Self-Calibration (LC, FW, ZH, HTT), pp. 308–311.
ICPRICPR-v2-2002-FrantiVK #bound #clustering
Branch-and-Bound Technique for Solving Optimal Clustering (PF, OV, TK), pp. 232–235.
ICPRICPR-v3-2002-HuangLLM #problem
Solving the Small Sample Size Problem of LDA (RH, QL, HL, SM), pp. 29–32.
ICPRICPR-v3-2002-Klette02a #problem
Switche May Solve Adjacency Problems (RK), pp. 907–910.
KRKR-2002-DoniniLMS
Solving QBF by SMV (FMD, PL, FM, MS), pp. 578–592.
SACSAC-2002-BistarelliFM #constraints
Soft constraint propagation and solving in CHRs (SB, TWF, MM), pp. 1–5.
SACSAC-2002-ChadesSC #approach #assessment #heuristic #problem
A heuristic approach for solving decentralized-POMDP: assessment on the pursuit problem (IC, BS, FC), pp. 57–62.
SACSAC-2002-LiL #problem
Local search with annealing-like restarts to solve the vehicle routing problem with time windows (HL, AL), pp. 560–565.
HPDCHPDC-2002-DeBardelebenLPS #framework #named #performance #problem
Coven — A Framework for High Performance Problem Solving Environments (ND, WBLI, SP, DCSJ), p. 291–?.
CADECADE-2002-AudemardBCKS #approach #linear #satisfiability
A SAT Based Approach for Solving Formulas over Boolean and Linear Mathematical Propositions (GA, PB, AC, AK, RS), pp. 195–210.
CADECADE-2002-Brown #higher-order #proving #set #theorem proving
Solving for Set Variables in Higher-Order Theorem Proving (CEB), pp. 408–422.
CADECADE-2002-Moller #difference #library #named #quantifier
DDDLIB: A Library for Solving Quantified Difference Inequalities (JBM), pp. 129–133.
CSLCSL-2002-CachatDT #automaton #game studies
Solving Pushdown Games with a Σ₃ Winning Condition (TC, JD, WT), pp. 322–336.
SATSAT-2002-AloulRMS #satisfiability #symmetry
Solving difficult SAT instances in the presence of symmetry (FAA, AR, IM, KS), p. 23.
SATSAT-2002-DuboisD #random #satisfiability
Renormalization as a function of clause lengths for solving random k-SAT formulae (OD, GD), p. 15.
SATSAT-2002-Kusper #linear #problem #satisfiability
Solving the resolution-free SAT problem by hyper-unit propagation in linear time (GK), p. 32.
WICSAWICSA-2001-Laine #architecture #development #embedded #object-oriented #problem #scalability
The Role of SW Architectures in Solving Fundamental Problems in Object-Oriented Development of Large Embedded SW Systems (PKL), pp. 14–23.
ITiCSEITiCSE-2001-Ginat #algorithm #learning #problem
Metacognitive awareness utilized for learning control elements in algorithmic problem solving (DG), pp. 81–84.
ITiCSEITiCSE-2001-SatratzemiDE #assessment #problem #visualisation
A system for program visualization and problem-solving path assessment of novice programmers (MS, VD, GE), pp. 137–140.
PASTEPASTE-2001-Hind #analysis #pointer #problem #question
Pointer analysis: haven’t we solved this problem yet? (MH), pp. 54–61.
SASSAS-2001-LiuLS #constraints #grammarware
Solving Regular Tree Grammar Based Constraints (YAL, NL, SDS), pp. 213–233.
ICALPICALP-2001-KorovinV #constraints #theorem proving
Knuth-Bendix Constraint Solving Is NP-Complete (KK, AV), pp. 979–992.
ICEISICEIS-v2-2001-EtcheverryLD #approach #coordination #problem
An Approach for Coordination Problem Solving (PE, PL, PD), pp. 880–883.
KDDKDD-2001-IndurkhyaW #classification #problem #rule-based
Solving regression problems with rule-based ensemble classifiers (NI, SMW), pp. 287–292.
GPCESAIG-2001-SasanoHT #generative #multi #performance #problem #source code
Generation of Efficient Programs for Solving Maximum Multi-marking Problems (IS, ZH, MT), pp. 72–91.
SACSAC-2001-LarocheBS #composition #markov #process
A new decomposition technique for solving Markov decision processes (PL, YB, RS), pp. 12–16.
HPDCHPDC-2001-SchuchardtMS #authoring #data transformation #distributed #open data #problem #version control
Open Data Management Solutions for Problem Solving Environments: Application of Distributed Authoring and Versioning to the Extensible Computational Chemistry Environment (KS, JDM, EGS), p. 228–?.
ICLPICLP-2001-Colmerauer #approximate #constraints #multi
Solving the Multiplication Constraint in Several Approximation Spaces (AC), p. 1.
ICSTSAT-2001-AmirM #composition #problem #satisfiability #using
Solving Satisfiability using Decomposition and the Most Constrained Subproblem (Preliminary Report) (EA, SM), pp. 329–343.
DACDAC-2000-HuangC #composition #constraints
Assertion checking by combined word-level ATPG and modular arithmetic constraint-solving techniques (CYH, KTC), pp. 118–123.
DATEDATE-2000-CatthoorDK #architecture #compilation #data transfer #how #memory management #question
How to Solve the Current Memory Access and Data Transfer Bottlenecks: At the Processor Architecture or at the Compiler Level? (FC, NDD, CEK), pp. 426–433.
DATEDATE-2000-CordoneFSC #approach #heuristic #performance #problem
An Efficient Heuristic Approach to Solve the Unate Covering Problem (RC, FF, DS, RWC), pp. 364–371.
SASSAS-2000-Podelski #constraints #model checking #theorem proving
Model Checking as Constraint Solving (AP), pp. 22–37.
CIAACIAA-2000-Neto #adaptation #automaton #problem
Solving Complex Problems Efficiently with Adaptive Automata (JJN), pp. 340–342.
ICFPICFP-2000-SasanoHTO #algorithm #linear #problem
Make it practical: a generic linear-time algorithm for solving maximum-weightsum problems (IS, ZH, MT, MO), pp. 137–149.
ICEISICEIS-2000-KleinerSB #estimation #learning
Self Organizing Maps for Value Estimation to Solve Reinforcement Learning Tasks (AK, BS, OB), pp. 149–156.
ICEISICEIS-2000-KostarasMMP #industrial #multi #problem #scalability
Solving Large Scale Multi-Criteria Job Sequencing Problems in Real Industrial Environments (GK, IM, GM, JEP), pp. 157–162.
ICMLICML-2000-WnagZ #approach #lazy evaluation #learning #multi #problem
Solving the Multiple-Instance Problem: A Lazy Learning Approach (JW, JDZ), pp. 1119–1126.
ICPRICPR-v3-2000-Verges-LlahiSC #algorithm #clustering #constraints #graph #image #segmentation
Color Image Segmentation Solving Hard-Constraints on Graph Partitioning Greedy Algorithms (JVL, AS, JC), pp. 3629–3632.
KDDKDD-2000-GardnerB #data mining #mining #problem
Data mining solves tough semiconductor manufacturing problems (MG, JB), pp. 376–383.
KRKR-2000-BaralMS #problem #using
Formulating diagnostic problem solving using an action language with narratives and sensing (CB, SAM, TCS), pp. 311–322.
UMLUML-2000-Padawitz #constraints #diagrams #how #proving #state machine #theorem proving #uml
Swinging UML: How to Make Class Diagrams and State Machines Amenable to Constraint Solving and Proving (PP), pp. 162–177.
PPDPPPDP-2000-LeuschelL #deduction #petri net #problem
Solving coverability problems of petri nets by partial deduction (ML, HL), pp. 268–279.
PADLPADL-2000-Hickey #constraints #named #theorem proving
CLIP: A CLP(Intervals) Dialect for Metalevel Constraint Solving (TJH), pp. 200–214.
PADLPADL-2000-YunesMS #approach #hybrid #problem #scalability #scheduling
A Hybrid Approach for Solving Large Scale Crew Scheduling Problems (THY, AVM, CCdS), pp. 293–307.
POPLPOPL-2000-Hickey #constraints #theorem proving
Analytic Constraint Solving and Interval Arithmetic (TJH), pp. 338–351.
SACSAC-2000-LimT #animation #evolution #interactive #problem
Solve Customers’ Problems: Interactive Evolution for Tinkering with Computer Animation (ISL, DT), pp. 404–407.
SACSAC-2000-YunesMS #problem #scalability #scheduling
Solving Very Large Crew Scheduling Problems to Optimality (THY, AVM, CCdS), pp. 446–451.
HPDCHPDC-2000-AllenBGHLMRSS #grid #problem
The Cactus Code: A Problem Solving Environment for the Grid (GA, WB, TG, HCH, GL, AM, TR, ES, JS), pp. 253–260.
HPDCHPDC-2000-GermainPMJ #named #parallel #problem
Uintah: A Massively Parallel Problem Solving Environment (JDdSG, SGP, JM, CRJ), pp. 33–42.
CAVCAV-2000-CassezL #constraints #hybrid #model checking
Model-Checking for Hybrid Systems by Quotienting and Constraints Solving (FC, FL), pp. 373–388.
CAVCAV-2000-VogeJ #algorithm #game studies
A Discrete Strategy Improvement Algorithm for Solving Parity Games (JV, MJ), pp. 202–215.
ICLPCL-2000-HolldoblerS #calculus #diagrams #problem #using
Solving the Entailment Problem in the Fluent Calculus Using Binary Decision Diagrams (SH, HPS), pp. 747–761.
WICSAWICSA-1999-HirschIM #constraints #graph grammar #modelling #theorem proving
Modeling Software Architecutes and Styles with Graph Grammars and Constraint Solving (DH, PI, UM), pp. 127–144.
DATEDATE-1999-SilvaSM #algorithm #satisfiability
Algorithms for Solving Boolean Satisfiability in Combinational Circuits (LGeS, LMS, JPMS), pp. 526–530.
ICDARICDAR-1999-StockerRL #classification #network #problem #self
Self-organized Classification Problem Solving with Yprel Neural Networks (ES, AR, YL), pp. 390–393.
TACASTACAS-1999-Heljanko #concurrent #logic programming #petri net #problem #reachability #semantics #source code #using
Using Logic Programs with Stable Model Semantics to Solve Deadlock and Reachability Problems for 1-Safe Petri Nets (KH), pp. 240–254.
FLOPSFLOPS-1999-FernandezH #constraints #framework #theorem proving
An Interval Lattice-Based Constraint Solving Framework for Lattices (AJF, PMH), pp. 194–208.
HCIHCI-CCAD-1999-JohnsonO #learning #multi #problem #using
Innovative mathematical learning environments — Using multimedia to solve real world problems (LFJ, POJ), pp. 677–681.
HCIHCI-CCAD-1999-Swezey #metric #performance #problem #simulation
Measurement of team problem solving performance via a computerized quasi-experimental simulation (RWS), pp. 482–486.
ICEISICEIS-1999-MelicioCR #problem
Solving the Timetabling Problem with Simulated Annealing (FM, JPC, ACR), pp. 272–279.
ECOOPECOOP-1999-PauwS #java #memory management #visualisation
Visualizing Reference Patterns for Solving Memory Leaks in Java (WDP, GS), pp. 116–134.
PADLPADL-1999-CadoliPSV #execution #named #problem #specification
NP-SPEC: An Executable Specification Language for Solving All Problems in NP (MC, LP, AS, DV), pp. 16–30.
SACSAC-1999-Bugarin #approximate #linear #polynomial
Linear Quadratic Approximation for Solving a Model Economy Distorted by Progressive Taxation (MNSB), pp. 52–56.
SACSAC-1999-Rivera-Gallego #algorithm #distance #matrix #problem #search-based
A Genetic Algorithm for Solving the Euclidean Distance Matrices Completion Problem (WRG), pp. 286–290.
CADECADE-1999-Pichler #equation #problem
Solving Equational Problems Efficiently (RP), pp. 97–111.
ICLPICLP-1999-DemoenBHMS #constraints #theorem proving
Herbrand Constraint Solving in HAL (BD, MJGdlB, WH, KM, PJS), pp. 260–274.
RTARTA-1999-NieuwenhuisR #constraints #order
Solved Forms for Path Ordering Constraints (RN, JMR), pp. 1–15.
STOCSTOC-1998-MourrainP #equation #multi #polynomial
Asymptotic Acceleration of Solving Multivariate Polynomial Systems of Equations (BM, VYP), pp. 488–496.
ICMLICML-1998-Heskes #approach #learning #multi
Solving a Huge Number of Similar Tasks: A Combination of Multi-Task Learning and a Hierarchical Bayesian Approach (TH), pp. 233–241.
PPDPALP-PLILP-1998-AjiliL #constraints #linear
Integrating Constraint Propagation in Complete Solving of Linear Diophantine Systems (FA, HCRL), pp. 463–480.
LOPSTRLOPSTR-1998-GabricGS #analysis #constraints #strict #theorem proving
Strictness Analysis as Finite-Domain Constraint Solving (TG, KG, HS), pp. 255–270.
SACSAC-1998-ArbabM #constraints #coordination #theorem proving #using
Using coordination for cooperative constraint solving (FA, EM), pp. 139–148.
SACSAC-1998-HarandiR #classification #distributed #problem
Classification and organizational issues in distributed problem solving (MTH, GR), pp. 65–69.
SACSAC-1998-KangH #algorithm #graph transformation #problem #search-based #using
Solving the rural postman problem using a genetic algorithm with a graph transformation (MJK, CGH), pp. 356–360.
SACSAC-1998-Nemer-PreeceW #algorithm #parallel #problem #satisfiability #search-based
Parallel genetic algorithm to solve the satisfiability problem (NNP, RWW), pp. 23–28.
ISMMISMM-1998-JohnstoneW #memory management #problem #question
The Memory Fragmentation Problem: Solved? (MSJ, PRW), pp. 26–36.
CSLCSL-1998-NarendranRV #constraints #theorem proving
RPO Constraint Solving Is in NP (PN, MR, RMV), pp. 385–398.
ISSTAISSTA-1998-GotliebBR #automation #constraints #generative #testing #theorem proving #using
Automatic Test Data Generation Using Constraint Solving Techniques (AG, BB, MR), pp. 53–62.
RTARTA-1998-LimetR #equation #term rewriting
Solving Disequations Modulo Some Class of Rewrite Systems (SL, PR), pp. 121–135.
DACDAC-1997-LiaoD #bound #problem #using
Solving Covering Problems Using LPR-Based Lower Bounds (SYL, SD), pp. 117–120.
DATEEDTC-1997-Coudert #graph #optimisation #problem
Solving graph optimization problems with ZBDDs (OC), pp. 224–228.
ICALPICALP-1997-DiekertMM #equation #normalisation #using
Solving Trace Equations Using Lexicographical Normal Forms (VD, YM, AM), pp. 336–346.
HCIHCI-CC-1997-PerusichM #fuzzy #problem #using
Using Fuzzy Cognitive Maps to Define the Search Space in Problem Solving (KP, MDM), pp. 805–808.
HCIHCI-SEC-1997-Chiu #effectiveness #modelling #problem
Modeling the User’s Problem-Solving Expertise for Effective Decision Support (CC), pp. 99–102.
HCIHCI-SEC-1997-HollnagelH #communication #lessons learnt #problem #question
Twenty-Five Years of Operator-Process Communication: Lessons Learned and Problems Solved? (EH, JØH), pp. 221–224.
AdaTRI-Ada-1997-SuchanS #ada #education #problem #using
Using Ada 95 as a Tool to Teach Problem Solving to Non-CS Majors (WKS, TLS), pp. 31–36.
PPDPPLILP-1997-Thompson #approach #education #functional #problem #programming
Where Do I Begin? A Problem Solving Approach in teaching Functional Programming (SJT), pp. 323–334.
CAVCAV-1997-ChanABN #constraints #model checking #theorem proving
Combining Constraint Solving and Symbolic Model Checking for a Class of a Systems with Non-linear Constraints (WC, RJA, PB, DN), pp. 316–327.
ICLPICLP-1997-CaseauL #constraints
Solving Small TSPs with Constraints (YC, FL), pp. 316–330.
RTARTA-1997-TomasF #equation #geometry #linear #using
Solving Linear Diophantine Equations Using the Geometric Structure of the Solution Space (APT, MF), pp. 269–283.
DACDAC-1996-Coudert #on the #problem
On Solving Covering Problems (OC), pp. 197–202.
CSEETCSEE-1996-Gates #problem
Integrating a Problem-Solving Methodology and Group Skills into CS1 (AQG), pp. 6–15.
WRLARWLW-1996-Castro #csp #using
Solving binary CSP using computational systems (CC), pp. 246–265.
SASSAS-1996-Snelting #constraints #metric #slicing #theorem proving #validation
Combining Slicing and Constraint Solving for Validation of Measurement Software (GS), pp. 332–348.
ICMLICML-1996-WieringS
Solving POMDPs with Levin Search and EIRA (MW, JS), pp. 534–542.
PPDPALP-1996-Benhamou #constraints #theorem proving
Heterogeneous Constraint Solving (FB), pp. 62–76.
POPLPOPL-1996-SagivRW #problem
Solving Shape-Analysis Problems in Languages with Destructive Updating (SS, TWR, RW), pp. 16–31.
SACSAC-1996-AbualiWS #algorithm #design #problem #search-based #set #using
Solving the subset interconnection design problem using genetic algorithms (FNA, RLW, DAS), pp. 299–304.
LICSLICS-1996-Narendran #equation #linear #polynomial
Solving Linear Equations over Polynomial Semirings (PN), pp. 466–472.
DACDAC-1995-Bergamaschi #design #problem #question #tool support
Productivity Issues in High-Level Design: Are Tools Solving the Real Problems? (RAB), pp. 674–677.
DACDAC-1995-CoudertM #problem
New Ideas for Solving Covering Problems (OC, JCM), pp. 641–646.
PEPMPEPM-1995-RamakrishnanRS #analysis #constraints #framework #logic programming #source code #theorem proving
A Symbolic Constraint Solving Framework for Analysis of Logic Programs (CRR, IVR, RCS), pp. 12–23.
ICALPICALP-1995-BestK #equation #recursion
Solving Recursive Net Equations (EB, MK), pp. 605–623.
LOPSTRLOPSTR-1995-WaalT #deduction #problem #program analysis #program transformation #using
Solving Deductive Planning Problems Using Program Analysis and Transformation (DAdW, MT), pp. 189–203.
SACSAC-1995-AbualiWS95a #algorithm #morphism #problem #search-based #using
Solving the three-star tree isomorphism problem using genetic algorithms (FNA, RLW, DAS), pp. 337–344.
SACSAC-1995-Spector #development #problem #using
Using system dynamics to model courseware development: the project dynamics of complex problem-solving (JMS), pp. 32–35.
ICLPICLP-1995-BurgSTY #constraints #equation #linear #logic programming
Linear Equation Solving for Constraint Logic Programming (JB, PJS, JCHT, RHCY), pp. 33–47.
ICLPICLP-1995-ChiuL #constraints #linear #theorem proving #using
Interval Linear Constraint Solving Using the Preconditioned Interval Gauss-Seidel Method (CKC, JHML), pp. 17–31.
ICLPILPS-1995-Dershowitz #semantics
Goal Solving as Operational Semantics (ND), pp. 3–17.
LICSLICS-1995-ComonNR #constraints #order #theorem proving
Orderings, AC-Theories and Symbolic Constraint Solving (Extended Abstract) (HC, RN, AR), pp. 375–385.
RTARTA-1995-BaaderS #algebra #constraints #perspective #theorem proving
Combination of Constraint Solving Techniques: An Algebraic POint of View (FB, KUS), pp. 352–366.
ICALPICALP-1994-CaronCCDJ #constraints
Pumping, Cleaning and Symbolic Constraints Solving (ACC, HC, JLC, MD, FJ), pp. 436–449.
PPDPALP-1994-Balbiani #equation
Equation Solving in Projective Planes and Planar Ternary Rings (PB), pp. 95–113.
PPDPPLILP-1994-CodognetD #constraints #performance #theorem proving
clp(B): Combining Simplicity and Efficiency in Boolean Constraint Solving (PC, DD), pp. 244–260.
CCCC-1994-Reps #analysis #interprocedural #problem
Solving Demand Versions of Interprocedural Analysis Problems (TWR), pp. 389–403.
HPDCHPDC-1994-HuiCYHA #difference #equation #network
Solving Partial Differential Equations on a Network of Workstations (CCH, GKKC, MMSY, MH, IA), pp. 194–201.
ICLPICLP-1994-KirchnerR #algebra #constraints #theorem proving
Constraint Solving by Narrowing in Combined Algebraic Domains (HK, CR), pp. 617–631.
ICLPILPS-1994-ChiuL #constraints #logic programming #theorem proving #towards
Towards Practical Interval Constraint Solving in Logic Programming (CKC, JHML), pp. 109–123.
FMFME-1993-EngelhardtR #problem
Generalizing Abadi & Lamport’s Method to Solve a Problem Posed by A. Pnueli (KE, WPdR), pp. 294–313.
HCIHCI-ACS-1993-Hayanhjelm #design #evolution #problem #process
The Ergonomic Deisgn Process — The User Involved in Problem Solving and the Design Evolution (HIJH), pp. 966–969.
HCIHCI-ACS-1993-KarlssonK #problem
Do Computers Solve the Problem? Telephone vs. Telefax vs. Computers in Home Shopping Systems in Scandinavia (MAK, MK), pp. 427–432.
HCIHCI-SHI-1993-Nakamura93a #problem #tool support
Problem Solving Support System as Thinking Acceleration Tools (TN), pp. 297–302.
HCIHCI-SHI-1993-YeS #design #interface #problem
Introducing Problem Solving Strategies of Users into the Interface Design (NY, GS), pp. 873–878.
HCIHCI-SHI-1993-YoungM #approach #assessment #learning #problem
A Situated Cognition Approach to Problem Solving with Implications for Computer-Based Learning and Assessment (MFY, MDM), pp. 825–830.
ICMLICML-1993-VanLehnJ #problem
Better Learners Use Analogical Problem Solving Sparingly (KV, RMJ), pp. 338–345.
SEKESEKE-1993-ChenV #fault #information management #problem
Knowledge Engineering in Fault Diagnostic Problem Solving (LC, PV), pp. 255–257.
ECOOPECOOP-1993-Meseguer #concurrent #inheritance #object-oriented #programming
Solving the Inheritance Anomaly in Concurrent Object-Oriented Programming (JM), pp. 220–246.
PPDPPLILP-1993-CorsiniMRC #abstract interpretation #bottom-up #constraints #finite #performance #prolog #theorem proving
Efficient Bottom-up Abstract Interpretation of Prolog by Means of Constraint Solving over Symbolic Finite Domains (MMC, KM, AR, BLC), pp. 75–91.
SACSAC-1993-GrimmLT #multi #problem
A Parallelized Search Strategy for Solving a Multicriteria Aircraft Routing Problem (JJG, GBL, AJT), pp. 570–577.
SACSAC-1993-KelleherLD #equation #on the #parallel #performance #reduction
On the Performance of a Direct Parallel Method for Solving Separable Elliptic Equations Based on Block Cyclic Reduction (KK, SL, SKD), pp. 517–524.
SACSAC-1993-PurdinH #approach #search-based
A Genetic-Algorithm Approach to Solving Crossword Puzzles (TDMP, GH), pp. 263–270.
ICLPICLP-1993-BisdorffL #industrial #problem
Industrial Disposing Problem Solved in CHIP (RB, SL), p. 831.
ICLPICLP-1993-Contejean #constraints #incremental #linear
Solving Linear Diophantine Constraints Incrementally (EC), pp. 532–549.
ICLPILPS-1993-BoizumaultDP #problem #using
Solving a real life exams problem using CHIP (PB, YD, LP), p. 661.
ICLPILPS-1993-CodognetD #constraints #theorem proving #using
Boolean Constraint Solving Using clp(FD) (PC, DD), pp. 525–539.
DACDAC-1992-LavagnoMBS #graph #problem
Solving the State Assignment Problem for Signal Transition Graphs (LL, CWM, RKB, ALSV), pp. 568–572.
CSCWCSCW-1992-BerlinJ #collaboration #learning #problem
Consultants and Apprentices: Observations about Learning and Collaborative Problem Solving (LMB, RJ), pp. 130–137.
ICMLML-1992-FawcettU #automation #generative #problem
Automatic Feature Generation for Problem Solving Systems (TF, PEU), pp. 144–153.
ICMLML-1992-Venturini #classification #named
AGIL: Solving the Exploration Versus Exploration Dilemma in a single Classifier System Applied to Simulated Robotics (GV), pp. 458–463.
SEKESEKE-1992-Bertolotti #interactive #problem
Opportunistic Production Planning Through Interactive Problem Solving (EB), pp. 404–411.
CSLCSL-1992-Schiermeyer #satisfiability
Solving 3-Satisfiability in Less Then 1, 579n Steps (IS), pp. 379–394.
LICSLICS-1992-AikenW #constraints #set
Solving Systems of Set Constraints (Extended Abstract) (AA, ELW), pp. 329–340.
DACDAC-1991-ShihK #approach #equation #named #performance #using
ILLIADS: A New Fast MOS Timing Simulator Using Direct Equation-Solving Approach (YHS, SMK), pp. 20–25.
VLDBVLDB-1991-Kent #database #object-oriented #problem #programming language
Solving Domain Mismatch and Schema Mismatch Problems with an Object-Oriented Database Programming Language (WK), pp. 147–160.
CHICHI-1991-KoenemannR #comprehension #problem
Expert problem solving strategies for program comprehension (JK, SPR), pp. 125–130.
KRKR-1991-ChalasaniEM #algorithm #performance #permutation #problem
Integrating Efficient Model-Learning and Problem-Solving Algorithms in Permutation Environments (PC, OE, JM), pp. 89–98.
STOCSTOC-1990-AggarwalHL #diagrams #problem
Solving Query-Retrieval Problems by Compacting Voronoi Diagrams (Extended Abstract) (AA, MH, FTL), pp. 331–340.
CSCWCSCW-1990-NardiM #development #distributed #problem #spreadsheet
An Ethnographic Study of Distributed Problem Solving in Spreadsheet Development (BAN, JRM), pp. 197–208.
ICMLML-1990-Kodratoff #abduction #problem #proving #using
Using Abductive Recovery of Failed Proofs for Problem Solving by Analogy (YK), pp. 295–303.
PPDPALP-1990-DershowitzMS #equation
Equation Solving in Conditional AC-Theories (ND, SM, GS), pp. 283–297.
LICSLICS-1990-BoudetCD #algorithm #equation #unification
A New AC Unification Algorithm with an Algorithm for Solving Systems of Diophantine Equations (AB, EC, HD), pp. 289–299.
LICSLICS-1990-Comon #algebra #equation
Solving Inequations in Term Algebras (Extended Abstract) (HC), pp. 62–69.
LICSLICS-1990-LarsenX #equation #using
Equation Solving Using Modal Transition Systems (KGL, LX), pp. 108–117.
SIGMODSIGMOD-1989-SunKN #database #problem
Solving Implication Problems in Database Applications (XHS, NK, LMN), pp. 185–192.
CAiSECAiSE-1989-RossiP #automation #integration #named
PCTE — Solving CASE Data Integration (KR, KP).
KRKR-1989-Rayner #predict #problem #question
Did Newton Solve the “Extended Prediction Problem”? (MR), pp. 381–385.
ICMLML-1989-Jones #learning #problem
Learning to Retrieve Useful Information for Problem Solving (RMJ), pp. 212–214.
ICMLML-1989-Schlimmer #problem #quality
Refining Representations to Improve Problem Solving Quality (JCS), pp. 457–460.
ICMLML-1989-VanLehn #problem #what
Discovering Problem Solving Strategies: What Humans Do and Machines Don’t (Yet) (KV), pp. 215–217.
RTARTA-1989-AbdulrabP #equation #linear #word
Solving Systems of Linear Diophantine Equations and Word Equations (HA, JPP), pp. 530–532.
RTARTA-1989-BertlingG #optimisation
Completion-Time Optimization of Rewrite-Time Goal Solving (HB, HG), pp. 45–58.
PPDPALP-1988-You #equation
Solving Equations in an Equational Language (JHY), pp. 245–254.
CADECADE-1988-Burckert #equation
Solving Disequations in Equational Theories (HJB), pp. 517–526.
ICLPJICSCP-1988-DincbasSH88 #constraints #logic programming #problem
Solving a Cutting-Stock Problem in Constraint Logic Programming (MD, HS, PVH), pp. 42–58.
STOCSTOC-1987-GoldbergT #approximate #low cost #problem
Solving Minimum-Cost Flow Problems by Successive Approximation (AVG, RET), pp. 7–18.
HCIHCI-CE-1987-AnzaiMIH #problem
A Serial-Parallel Integrated Information-Processing Model for Complex Human Problem Solving (YA, HM, MI, YH), pp. 175–182.
HCIHCI-CE-1987-GlinertGS #approach #problem #programming #visual notation
An Integrated Approach to Solving Visual Programming’s Problems (EPG, JG, CDS), pp. 341–348.
HCIHCI-CE-1987-Gonzalez-SustaetaM #database #natural language #paradigm #query #semantics
A Semantic Paradigm to Solve Natural Language Database Queries (JGS, CM), pp. 113–120.
HCIHCI-CE-1987-Kitto #information management #paradigm #problem #research #tool support
Knowledge Acquisition Tools for Different Problem-Solving Paradigms Research at Boeing Computing Services (CMK), pp. 515–522.
LICSLICS-1987-GoguenM #algebra #multi #order
Order-Sorted Algebra solves the Constructor-Selector, Multiple (JAG, JM), pp. 18–29.
LICSLICS-1987-KirchnerL #equation
Solving Disequations (CK, PL), pp. 347–352.
PODSPODS-1986-SagivS #equivalence #query
The Equivalence of Solving Queries and Production Tree Projections (YS, OS), pp. 160–172.
SIGIRSIGIR-1986-BerrutP #automation #parsing
Solving Grammatical Ambiguities within a Surface Syntactical Parser for Automatic Indexing (CB, PP), pp. 123–130.
CADECADE-1986-DickC #automation #empirical #equation #reasoning #using
Using Narrowing to do Isolation in Symbolic Equation Solving — An Experiment in Automated Reasoning (AJJD, JC), pp. 272–280.
RTARTA-1985-Ait-Kaci #equation #graph grammar
Solving Type Equations by Graph Rewriting (HAK), pp. 158–179.
DACDAC-1984-AshokMR #design #problem #process
Uniform support for information handling and problem solving required by the VLSI design process (VA, WLM, JR), pp. 694–696.
PODSPODS-1984-OzsoyogluC #on the #query
On the Cyclic to Acyclic Scheme Transformation and Solving Cyclic Queries (ZMÖ, EC), pp. 133–142.
ICALPICALP-1984-PaigeT #algorithm #linear #problem
A Linear Time Algorithm to Solve the Single Function Coarsest Partition Problem (RP, RET), pp. 371–379.
CADECADE-1984-OhlbachW #automation #logic #problem #proving #theorem proving
Solving a Problem in Relevance Logic with an Automated Theorem Prover (HJO, GW), pp. 496–508.
CADECADE-1984-PelinG #algebra #complexity #problem #using #word
Solving Word Problems in Free Algebras Using Complexity Functions (AP, JHG), pp. 476–495.
ICLPILPC-1984-Sterling84 #logic #problem
Logical Levels of Problem Solving (LS), pp. 231–242.
VLDBVLDB-1983-Reimer #concurrent #problem
Solving the Phantom Problem by Predicative Optimistic Concurrency Control (MR), pp. 81–88.
ICALPICALP-1983-HambruschS #bound #graph #problem
Lower Bounds for Solving Undirected Graph Problems on VLSI (SEH, JS), pp. 292–303.
CADECADE-1982-Wos #automation
Solving Open Questions with an Automated Theorem-Proving Program (LW), pp. 1–31.
DACDAC-1981-MartinBLMMTW #design #named #problem
CELTIC — solving the problems of LSI design with an integrated polycell DA system (GM, JB, TL, DM, JM, DT, LW), pp. 804–811.
ICSEICSE-1979-JonesS #distributed #problem
TASK Forces: Distributed Software for Solving Problems of Substantial Size (AKJ, KS), pp. 315–331.
VLDBVLDB-1975-Carlson #database #interactive #problem #scalability #using
Using Large Data Bases for Interactive Problem Solving (EDC), pp. 499–501.
DACDAC-1970-KrolakFM #approach #problem #towards
A man-machine approach toward solving the traveling salesman problem (PDK, WF, GM), pp. 250–264.

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.