## Tag #problem

### 2495 papers:

- CSL-2020-Jez #equation #unification #word
- Solving Word Equations (And Other Unification Problems) by Recompression (Invited Talk) (AJ), p. 17.
- EDM-2019-BahargamLT #algorithm #clustering #complexity
- The Guided Team-Partitioning Problem: Definition, Complexity, and Algorithm (SB, TL, ET).
- EDM-2019-ChenGD #multi
- Parent as a Companion for Solving Challenging Math Problems: Insights from Multi-modal Observational Data (LC, EG, AD).
- EDM-2019-KangAYL #collaboration #game studies #process #similarity
- Collaborative Problem-Solving Process in A Science Serious Game: Exploring Group Action Similarity Trajectory (JK, DA, LY, ML0).
- EDM-2019-MussackFSC #behaviour #learning #similarity #towards
- Towards discovering problem similarity through deep learning: combining problem features and user behavior (DM, RF, PS, PCL).
- EDM-2019-NguyenSM #modelling #student #towards
- Towards Modeling Students' Problem-solving Skills in Non-routine Mathematics Problems (HN, JCS, BMM).
- EDM-2019-ReillyS #analysis #collaboration #predict #quality
- Predicting the Quality of Collaborative Problem Solving Through Linguistic Analysis of Discourse (JMR, BS).
- ICPC-2019-EposhiOGSOO #design #question #refactoring
- Removal of design problems through refactorings: are we looking at the right symptoms? (AE, WNO, AG, LdSS, RFO, AO), pp. 148–153.
- CIAA-2019-SmithS #2d #automaton #strict
- Decision Problems for Restricted Variants of Two-Dimensional Automata (TJS, KS), pp. 222–234.
- DLT-2019-BroughCP #context-free grammar #word
- Context-Free Word Problem Semigroups (TB, AJC, MP), pp. 292–305.
- FM-2019-JongmansLE
- SOA and the Button Problem (SSJ, AL, MCJDvE), pp. 689–706.
- FSCD-2019-Larchey-Wendling #coq
- Hilbert's Tenth Problem in Coq (DLW, YF0), p. 20.
- IFM-2019-BowlesC #approach #combinator #optimisation
- An Integrated Approach to a Combinatorial Optimisation Problem (JB, MBC), pp. 284–302.
- CoG-2019-AndroulakakisF #behaviour #evolution
- Evolution of Kiting Behavior in a Two Player Combat Problem (PA, ZEF), pp. 1–8.
- CoG-2019-ChenC
- Modified PPO-RND Method for Solving Sparse Reward Problem in ViZDoom (JCC, THC), pp. 1–4.
- CoG-2019-ParakhCS #approach #design #game studies #network #towards
- An Approach Towards Designing Problem Networks in Serious Games (AP, PC, MS), pp. 1–8.
- VS-Games-2019-RodriguesFPPS #game studies #named
- Festarola: a Game for Improving Problem Solving Strategies (RR0, PCF, RP, PP, AMVS), pp. 1–8.
- CIKM-2019-QiuW0 #multi #predict
- Question Difficulty Prediction for Multiple Choice Problems in Medical Exams (ZQ, XW, WF0), pp. 139–148.
- CIKM-2019-ZhaoLZWJXWM #evaluation #matter #what
- What You Look Matters?: Offline Evaluation of Advertising Creatives for Cold-start Problem (ZZ, LL, BZ0, MW, YJ, LX, FW, WYM), pp. 2605–2613.
- ICML-2019-BrutzkusG #modelling #why
- Why do Larger Models Generalize Better? A Theoretical Perspective via the XOR Problem (AB, AG), pp. 822–830.
- ICML-2019-CaoS #learning #multi
- Dynamic Learning with Frequent New Product Launches: A Sequential Multinomial Logit Bandit Problem (JC, WS), pp. 912–920.
- ICML-2019-ChenXHY #named #scalability
- Katalyst: Boosting Convex Katayusha for Non-Convex Problems with a Large Condition Number (ZC, YX, HH, TY), pp. 1102–1111.
- ICML-2019-InnesL #learning
- Learning Structured Decision Problems with Unawareness (CI, AL), pp. 2941–2950.
- ICML-2019-LeeW #algorithm #first-order #performance
- First-Order Algorithms Converge Faster than $O(1/k)$ on Convex Problems (CPL, SW), pp. 3754–3762.
- ICML-2019-ZanetteB #bound #learning #using
- Tighter Problem-Dependent Regret Bounds in Reinforcement Learning without Domain Knowledge using Value Function Bounds (AZ, EB), pp. 7304–7312.
- KDD-2019-AnastasiuRT #named #order #tutorial
- Tutorial: Are You My Neighbor?: Bringing Order to Neighbor Computing Problems (DCA, HR, AT), pp. 3241–3242.
- KDD-2019-ChenTYZC #approach #data-driven #industrial #multi
- A Data-Driven Approach for Multi-level Packing Problems in Manufacturing Industry (LC0, XT, MY, JZ, LC0), pp. 1762–1770.
- KDD-2019-LiC0W0 #3d #crowdsourcing #platform
- Three-Dimensional Stable Matching Problem for Spatial Crowdsourcing Platforms (BL, YC, YY0, GW, LC0), pp. 1643–1653.
- KDD-2019-ZafaraniZSL #detection #research
- Fake News Research: Theories, Detection Strategies, and Open Problems (RZ, XZ, KS, HL0), pp. 3207–3208.
- SAS-2019-FijalkowLOOP0 #abstract interpretation #on the
- On the Monniaux Problem in Abstract Interpretation (NF, EL, PO, JO, AP, JW0), pp. 162–180.
- ASE-2019-NamHMMV #api #identification #mining #named #usability
- MARBLE: Mining for Boilerplate Code to Identify API Usability Problems (DN, AH, AM, BAM, BV), pp. 615–627.
- ESEC-FSE-2019-Gizzatullina #agile #communication #empirical #requirements
- Empirical study of customer communication problem in agile requirements engineering (IG), pp. 1262–1264.
- ASPLOS-2019-LiDX #quantum
- Tackling the Qubit Mapping Problem for NISQ-Era Quantum Devices (GL, YD, YX0), pp. 1001–1014.
- CASE-2019-GunawanYWV #multi
- Simulated Annealing for the Multi-Vehicle Cyclic Inventory Routing Problem (AG, VFY, ATW, PV), pp. 691–696.
- CASE-2019-LuoLLWG #multi #optimisation #scheduling #using
- Green Job Shop Scheduling Problem with Machine at Different Speeds using a multi-objective grey wolf optimization algorithm* (YL, CL, XL, LW, LG0), pp. 573–578.
- CASE-2019-MatsuokaNT #approach #identification #machine learning #scheduling
- Machine Learning Approach for Identification of Objective Function in Production Scheduling Problems (YM, TN, KT), pp. 679–684.
- CASE-2019-PengPWDLG #scheduling
- Iterated Local Search for Steelmaking-refining-Continuous Casting Scheduling Problem (KP, QKP, LW, XD, CL, LG0), pp. 567–572.
- CASE-2019-RoselliBA #analysis #flexibility #scheduling #smt
- SMT Solvers for Flexible Job-Shop Scheduling Problems: A Computational Analysis (SFR, KB, KÅ), pp. 673–678.
- CASE-2019-WangW #algorithm #distributed #hybrid #scheduling
- An Iterated Greedy Algorithm for Distributed Hybrid Flowshop Scheduling Problem with Total Tardiness Minimization (JjW, LW), pp. 350–355.
- JCDL-2018-Owens #challenge #library
- We Have Interesting Problems: Some Applied Grand Challenges from Digital Libraries, Archives and Museums (TO), p. 1.
- EDM-2018-Andrews-ToddFSR #collaboration #identification #online
- Identifying Profiles of Collaborative Problem Solvers in an Online Electronics Environment (JAT, CF, JS, AR).
- EDM-2018-SawyerRAL #analysis #behaviour #game studies #learning #student
- Filtered Time Series Analyses of Student Problem-Solving Behaviors in Game-based Learning (RS, JPR, RA, JCL).
- MSR-2018-MahmoudiN #android #empirical
- The Android update problem: an empirical study (MM, SN), pp. 220–230.
- SANER-2018-Xu0B #automation #design
- Automatically exploiting implicit design knowledge when solving the class responsibility assignment problem (YX, PL0, MAB), pp. 197–209.
- SCAM-2018-HarmanO #program analysis
- From Start-ups to Scale-ups: Opportunities and Open Problems for Static and Dynamic Program Analysis (MH, PWO), pp. 1–23.
- DLT-2018-0001JJ #automaton #complexity #finite #self #verification
- Computational Complexity of Decision Problems on Self-verifying Finite Automata (MH0, SJ, JJJ), pp. 404–415.
- DLT-2018-EberhardEH #complexity
- Complexity of Decision Problems on Totally Rigid Acyclic Tree Grammars (SE, GE, SH), pp. 291–303.
- DLT-2018-Fleischer #finite
- The Intersection Problem for Finite Semigroups (LF), pp. 318–329.
- DLT-2018-Gruber0W #finite #on the
- On Minimal Grammar Problems for Finite Languages (HG, MH0, SW), pp. 342–353.
- DLT-2018-HanK0S #regular expression #string
- Closest Substring Problems for Regular Languages (YSH, SKK, TN0, KS), pp. 392–403.
- DLT-2018-KoNP #integer #nondeterminism #polynomial #reachability
- Reachability Problems in Nondeterministic Polynomial Maps on the Integers (SKK, RN, IP), pp. 465–477.
- DLT-2018-Michielini #finite #first-order #logic #word
- Uniformization Problem for Variants of First Order Logic over Finite Words (VM), pp. 516–528.
- DLT-2018-Winslow
- Some Open Problems in Polyomino Tilings (AW), pp. 74–82.
- CIKM-2018-LiuPZJH #generative #keyword #natural language #query
- Generating Keyword Queries for Natural Language Queries to Alleviate Lexical Chasm Problem (XL, SP, QZ0, YGJ, XH), pp. 1163–1172.
- ECIR-2018-BorattoCFP #documentation
- Employing Document Embeddings to Solve the “New Catalog” Problem in User Targeting, and Provide Explanations to the Users (LB, SC, GF, LP), pp. 371–382.
- ICML-2018-AbeilleL #bound #linear #polynomial
- Improved Regret Bounds for Thompson Sampling in Linear Quadratic Control Problems (MA, AL), pp. 1–9.
- ICML-2018-BargiacchiVRNH #coordination #graph #learning #multi
- Learning to Coordinate with Coordination Graphs in Repeated Single-Stage Multi-Agent Decision Problems (EB, TV, DMR, AN, HvH), pp. 491–499.
- ICML-2018-BernsteinWAA #named #optimisation
- SIGNSGD: Compressed Optimisation for Non-Convex Problems (JB, YXW, KA, AA), pp. 559–568.
- ICML-2018-GanianKOS #algorithm #matrix
- Parameterized Algorithms for the Matrix Completion Problem (RG, IAK, SO, SS), pp. 1642–1651.
- ICML-2018-HanHZ #classification #estimation #multi #scalability
- Candidates vs. Noises Estimation for Large Multi-Class Classification Problem (LH, YH, TZ), pp. 1885–1894.
- ICML-2018-KhamaruW #convergence #optimisation
- Convergence guarantees for a class of non-convex and non-smooth optimization problems (KK, MJW), pp. 2606–2615.
- ICML-2018-SharmaNK #clique #random #using
- Solving Partial Assignment Problems using Random Clique Complexes (CS, DN, MK), pp. 4593–4602.
- ICML-2018-ZanetteB #bound #identification #learning
- Problem Dependent Reinforcement Learning Bounds Which Can Identify Bandit Structure in MDPs (AZ, EB), pp. 5732–5740.
- ICPR-2018-BlumenthalDBBG #distance #edit distance #graph #polynomial
- Quasimetric Graph Edit Distance as a Compact Quadratic Assignment Problem (DBB, ÉD, SB, LB, JG), pp. 934–939.
- ICPR-2018-ChengHW #towards #visual notation
- Towards Unconstrained Pointing Problem of Visual Question Answering: A Retrieval-based Method (WC, YH0, LW0), pp. 3303–3308.
- ICPR-2018-MahboubiBC #approach #identification
- A structural approach to Person Re-identification problem (AM, LB, DC), pp. 1616–1621.
- ICPR-2018-ZhangSW #linear #network
- Cascade Deep Networks for Sparse Linear Inverse Problems (HZ, HS, WW), pp. 812–817.
- KDD-2018-AgarwalBGXYZ #online #parametricity #ranking
- Online Parameter Selection for Web-based Ranking Problems (DA, KB0, SG, YX, YY, LZ), pp. 23–32.
- KDD-2018-LiYCYZ #3d #algorithm #constraints #data-driven #delivery
- A Data-Driven Three-Layer Algorithm for Split Delivery Vehicle Routing Problem with 3D Container Loading Constraint (XL, MY, DC, JY, JZ), pp. 528–536.
- KDD-2018-Teh #big data #learning #on the
- On Big Data Learning for Small Data Problems (YWT), p. 3.
- KDD-2018-WangZ #learning #towards
- Towards Mitigating the Class-Imbalance Problem for Partial Label Learning (JW, MLZ), pp. 2427–2436.
- MoDELS-2018-BallarinMPC #metric
- Measures to report the Location Problem of Model Fragment Location (MB, ACM, VP, CC), pp. 189–199.
- POPL-2018-LiY #algorithm #analysis #quantum #source code #termination
- Algorithmic analysis of termination problems for quantum programs (YL, MY), p. 29.
- PPDP-2018-SakanashiS #combinator #constraints #optimisation #sql
- Transformation of Combinatorial Optimization Problems Written in Extended SQL into Constraint Problems (GS, MS), p. 13.
- ESEC-FSE-2018-BarikFMP #compilation #developer #how #question
- How should compilers explain problems to developers? (TB, DF, ERMH, CP), pp. 633–643.
- ESEC-FSE-2018-HeLLZLZ #analysis #identification
- Identifying impactful service system problems via log analysis (SH, QL, JGL, HZ0, MRL, DZ), pp. 60–70.
- ICSE-2018-MahajanAMH #automation #mobile #web
- Automated repair of mobile friendly problems in web pages (SM, NA, PM, WGJH), pp. 140–150.
- ICSE-2018-SousaOOBGLKMFOL #design #identification #source code
- Identifying design problems in the source code: a grounded theory (LdSS, AO, WNO, SDJB, AG, JL, MK, RMdM, BF, RFO, CL, RBdP), pp. 921–931.
- ICSE-2018-XueL #feature model #integer #multi #optimisation #programming
- Multi-objective integer programming approaches for solving optimal feature selection problem: a new perspective on multi-objective optimization problems in SBSE (YX, YFL), pp. 1231–1242.
- CASE-2018-AbbatecolaFPU #approach #clustering
- A New Cluster-Based Approach for the Vehicle Routing Problem with Time Windows (LA, MPF, GP, WU), pp. 744–749.
- CASE-2018-CaoGZL #algorithm #hybrid #scheduling #self
- A Self-braking Symbiotic Organisms Search Algorithm for Bi-objective Reentrant Hybrid Flow Shop Scheduling Problem (ZC, SG, MZ, KL), pp. 803–808.
- CASE-2018-CaoLH #automation #order #scheduling
- An Improved MOEA/D for Order Scheduling Problem in Automated Warehouse (ZC, KL, BH), pp. 797–802.
- CASE-2018-HaoQ #automation #layout
- Solving Unequal-Area Facility Layout Problems with Orbits in Fully Automatic System (XH, MQ), pp. 1183–1188.
- CASE-2018-KacarMU #reduction #using
- Problem Reduction Approaches for Production Planning Using Clearing Functions (NBK, LM, RU), pp. 931–938.
- CASE-2018-LaiZJQ
- Forest-based Tabu Search to the Split-delivery Capacitated Arc-routing Problem (QL, ZZ, XJ, HQ), pp. 1237–1242.
- CASE-2018-LuZH #assembly #delivery #optimisation
- Optimization of Material Delivery Problem for Aircraft Moving Assembly Line (ZL, HZ, XH), pp. 926–930.
- CASE-2018-QuintonHH #algorithm #flexibility
- Algorithms for the flexible cyclic jobshop problem (FQ, IH, LH), pp. 945–950.
- CASE-2018-RiaziBL #algorithm #parallel
- Parallelization of a gossip algorithm for vehicle routing problems (SR, KB, BL), pp. 92–97.
- CASE-2018-RoselliBA #comparison #evaluation #modelling #performance #scheduling #smt
- SMT Solvers for Job-Shop Scheduling Problems: Models Comparison and Performance Evaluation (SFR, KB, KÅ), pp. 547–552.
- CASE-2018-WangDML #algorithm #scheduling #search-based
- A Grouping Genetic Algorithm for the Intercell Scheduling Problem (SW, SD, TM, DL), pp. 956–961.
- CASE-2018-WuL #algorithm #difference #distributed #evolution #flexibility #scheduling
- An Improved Differential Evolution Algorithm for Solving a Distributed Flexible Job Shop Scheduling Problem (XW, XL), pp. 968–973.
- CASE-2018-YuZZW #layout #programming
- Hybridizing tabu search with mathematical programming for solving a single row layout problem (MY, XZ, XZ, CW), pp. 974–980.
- CASE-2018-ZhangZG #case study #multi #optimisation
- Multiobjective Optimization Approaches to Airline Crew Rostering Problems: A Case Study (ZZ, MZ, SG), pp. 750–755.
- CASE-2018-ZhuLH #algorithm #heuristic #multi #scheduling
- A Modified Heuristic Algorithm for Resource Constrained Multi-project Scheduling Problem based on Inspection and Rework (HZ, ZL, XH), pp. 1058–1063.
- CAV-2018-KongSG
- Delta-Decision Procedures for Exists-Forall Problems over the Reals (SK, ASL, SG), pp. 219–235.
- CSL-2018-BodirskyMV #constraints #infinity
- Submodular Functions and Valued Constraint Satisfaction Problems over Infinite Domains (MB, MM, CV), p. 22.
- ICST-2018-FengJ0F #classification #empirical #multi
- An Empirical Study on Software Failure Classification with Multi-label and Problem-Transformation Techniques (YF0, JAJ, ZC0, CF), pp. 320–330.
- IJCAR-2018-BodirskyG #complexity #constraints
- Complexity of Combinations of Qualitative Constraint Satisfaction Problems (MB, JG), pp. 263–278.
- IJCAR-2018-Bromberger #bound #linear #reduction
- A Reduction from Unbounded Linear Mixed Arithmetic Problems into Bounded Problems (MB), pp. 329–345.
- IJCAR-2018-LagniezBLM #approach #satisfiability
- An Assumption-Based Approach for Solving the Minimal S5-Satisfiability Problem (JML, DLB, TdL, VM), pp. 1–18.
- CSEET-2017-SilvaSC #question
- Is It Better to Learn from Problems or Erroneous Examples? (WAFS, IFS, TUC), pp. 222–231.
- EDM-2017-BauerFP #analysis #behaviour #challenge #game studies
- Analysis of problem-solving behavior in open-ended scientific-discovery game challenges (AB, JF, ZP).
- EDM-2017-DoroudiB
- The Misidentified Identifiability Problem of Bayesian Knowledge Tracing (SD, EB).
- SANER-2017-TiellaC #automation #clique #generative #obfuscation
- Automatic generation of opaque constants based on the k-clique problem for resilient data obfuscation (RT, MC), pp. 182–192.
- CIAA-2017-Ryzhikov #automaton
- Synchronization Problems in Automata Without Non-trivial Cycles (AR), pp. 188–200.
- ICFP-2017-ByrdBRM #approach #functional #programming
- A unified approach to solving seven programming problems (functional pearl) (WEB, MB, GR, MM), p. 26.
- FDG-2017-BauerBP #architecture #design #game studies #learning
- Dragon architect: open design problems for guided learning in a creative computational thinking sandbox game (AB0, EB, ZP), p. 6.
- FDG-2017-FarlowT #heuristic
- Greedy heuristics for client assignment problem by zones (SF, JLT), p. 10.
- FDG-2017-NielsenK #game studies #internet
- The problematic coexistence of “internet gaming disorder” and esports (RKLN, VMK), p. 4.
- FDG-2017-Schrier #game studies #what
- What's in a name?: naming games that solve real-world problems (KS), p. 4.
- CIKM-2017-LuJEDRSS
- Scenic Routes Now: Efficiently Solving the Time-Dependent Arc Orienteering Problem (YL0, GJ, TE, UD, MR, CS, MS), pp. 487–496.
- CIKM-2017-RuchanskyBGGK
- To Be Connected, or Not to Be Connected: That is the Minimum Inefficiency Subgraph Problem (NR, FB, DGS, FG, NK), pp. 879–888.
- ECIR-2017-Chehreghani #analysis #feature model
- Feature-Oriented Analysis of User Profile Completion Problem (MHC), pp. 304–316.
- ICML-2017-0001JZ #analysis #geometry #rank
- No Spurious Local Minima in Nonconvex Low Rank Problems: A Unified Geometric Analysis (RG0, CJ, YZ), pp. 1233–1242.
- ICML-2017-ArjevaniS #complexity #higher-order
- Oracle Complexity of Second-Order Methods for Finite-Sum Problems (YA, OS), pp. 205–213.
- ICML-2017-BalduzziFLLMM #question #what
- The Shattered Gradients Problem: If resnets are the answer, then what is the question? (DB, MF, LL, JPL, KWDM, BM), pp. 342–350.
- ICML-2017-BriolOCCG #kernel #on the
- On the Sampling Problem for Kernel Quadrature (FXB, CJO, JC, WYC, MAG), pp. 586–595.
- ICML-2017-NguyenLST #machine learning #named #novel #probability #recursion #using
- SARAH: A Novel Method for Machine Learning Problems Using Stochastic Recursive Gradient (LMN, JL, KS, MT), pp. 2613–2621.
- ICML-2017-RahmaniA17a #approach #clustering
- Innovation Pursuit: A New Approach to the Subspace Clustering Problem (MR, GKA), pp. 2874–2882.
- ICML-2017-ThiLNT #classification #probability
- Stochastic DCA for the Large-sum of Non-convex Functions Problem and its Application to Group Variable Selection in Classification (HALT, HML, PDN, BT), pp. 3394–3403.
- KDD-2017-AhmedLSW #algorithm #industrial #modelling #topic
- A Practical Algorithm for Solving the Incoherence Problem of Topic Models In Industrial Applications (AA, JL, DS, YW), pp. 1713–1721.
- KDD-2017-LakkarajuKLLM #algorithm #predict
- The Selective Labels Problem: Evaluating Algorithmic Predictions in the Presence of Unobservables (HL, JMK, JL, JL, SM), pp. 275–284.
- KDD-2017-SharmaSKS #machine learning
- The Fake vs Real Goods Problem: Microscopy and Machine Learning to the Rescue (AS, VS, VK, LS), pp. 2011–2019.
- OOPSLA-2017-SamanthaNNR #mining #specification
- Exploiting implicit beliefs to resolve sparse usage problem in usage-based specification mining (SKS, HAN, TNN, HR), p. 29.
- ASE-2017-RahimiXCL #safety
- Diagnosing assumption problems in safety-critical products (MR, WX, JCH, RRL), pp. 473–484.
- CASE-2017-ClementeFNSU #modelling #multi
- Modelling and solving the multi-day container drayage problem (MC, MPF, MN, GS, WU), pp. 231–236.
- CASE-2017-CuiHD #collaboration #network
- 4PL collaborative routing customization problem on the dynamic networks (YC, MH0, QD), pp. 1345–1349.
- CASE-2017-DengHWY #multi
- Multi-point to multi-point multi-task fourth party logistics routing problem considering tardiness risk (LD, MH, DW, MY), pp. 1350–1355.
- CASE-2017-FranckAXG #approach #people
- An optimization-simulation approach for long term care structure assignment problem for elderly people (TF, VA, XX, RG), pp. 574–579.
- CASE-2017-GongHC #algorithm #scheduling
- An improved symbiotic organisms search algorithm for low-yield stepper scheduling problem (SG, RH, ZC), pp. 289–294.
- CASE-2017-HaoLW
- An improved global replacement strategy for MOEA/D on many-objective kanpsack problems (XH, JL, ZW), pp. 624–629.
- CASE-2017-JongRANO #automation #big data #estimation #scheduling #towards
- Big data in automation: Towards generalized makespan estimation in shop scheduling problems (AWdJ, JIUR, MA, TN, JO), pp. 1516–1521.
- CASE-2017-LiuLH #algorithm #difference #evolution
- A differential evolution algorithm for the resource investment problem with discounted cash flows (ML, JL, XH), pp. 1554–1559.
- CASE-2017-LuQ #algorithm #energy #parallel #scheduling #search-based
- An improved genetic algorithm for a parallel machine scheduling problem with energy consideration (HL0, FQ), pp. 1487–1492.
- CASE-2017-RochollM #algorithm #multi #order #scheduling #search-based
- Genetic algorithms for a single-machine multiple orders per job scheduling problem with a common due date (JR, LM), pp. 1038–1039.
- CASE-2017-WangCHZ #case study #scheduling
- A study on attribute selection for job shop scheduling problem (ZW, ZC, RH, JZ), pp. 1032–1037.
- CASE-2017-WangOLC #big data #self #using
- Capacitated competitive facility location problem of self-collection lockers by using public big data (YW0, TO, LHL, EPC), p. 1344.
- CASE-2017-WuLL #adaptation
- Adaptive sampling rule for ranking-and-selection problem (RW, SL, JL), pp. 1499–1505.
- CASE-2017-YamazakiNS #abstraction #composition #first-order #hybrid #petri net
- A decomposition method with discrete abstraction for simultaneous traffic signal control and route selection problem with first-order hybrid Petri Nets (RY, TN, SS), pp. 352–357.
- CASE-2017-ZhangMAP #generative
- A simulation-based benders' cuts generation for the joint workstation, workload and buffer allocation problem (MZ, AM, AA, GP), pp. 1067–1072.
- CASE-2017-ZhaoLHD #analysis #flexibility #performance
- Optimal planning of plant flexibility: Problem formulation and performance analysis (CZ, JL, NH, GAD), p. 986.
- CASE-2017-ZouMY #algorithm #difference #evolution #hybrid #industrial
- A hybrid differential evolution algorithm for open-order coil allocation problem in the steel industry (FZ, YM, YY), pp. 636–641.
- CADE-2017-BrotherstonGK #array #logic
- Biabduction (and Related Problems) in Array Separation Logic (JB, NG, MIK), pp. 472–490.
- EDM-2016-ChenDP #diagrams #using
- Examining the necessity of problem diagrams using MOOC AB experiments (ZC, ND, DEP), pp. 579–580.
- EDM-2016-ChenLXSMD #multimodal #process
- Riding an emotional roller-coaster: A multimodal study of young child's math problem solving activities (LC, XL, ZX, ZS, LPM, AD), pp. 38–45.
- EDM-2016-HaoLDKK #analysis #collaboration #data mining #mining #statistics
- Collaborative Problem Solving Skills versus Collaboration Outcomes: Findings from Statistical Analysis and Data Mining (JH, LL, AvD, PCK, CK), pp. 382–387.
- EDM-2016-MalkiewichBSKP #behaviour #education #game studies
- Classifying behavior to elucidate elegant problem solving in an educational game (LM, RSB, VS, SK, LP), pp. 448–453.
- EDM-2016-MostafaviB #data-driven #logic #student
- Exploring the Impact of Data-driven Tutoring Methods on Students' Demonstrative Knowledge in Logic Problem Solving (BM, TB), pp. 460–465.
- EDM-2016-RamanarayananK #behaviour #collaboration #novel
- Novel features for capturing cooccurrence behavior in dyadic collaborative problem solving tasks (VR, SK), pp. 620–621.
- EDM-2016-Sande #component #learning #multi
- Learning Curves for Problems with Multiple Knowledge Components (BvdS), pp. 523–526.
- EDM-2016-Sande16a #analysis #component #learning
- Learning curves versus problem difficulty: an analysis of the Knowledge Component picture for a given context (BvdS), pp. 646–647.
- EDM-2016-SlaterOBSIH #learning #semantics #student
- Semantic Features of Math Problems: Relationships to Student Learning and Engagement (SS, JO, RSB, PS, PSI, NTH), pp. 223–230.
- MSR-2016-LaymanNMM #modelling #research #topic
- Topic modeling of NASA space system problem reports: research in practice (LL, APN, JM, TM), pp. 303–314.
- MSR-2016-TrautschHMG #framework #mining #platform #repository
- Adressing problems with external validity of repository mining studies through a smart data platform (FT, SH, PM, JG), pp. 97–108.
- SANER-2016-DecanMCG #analysis #dependence #git
- When GitHub Meets CRAN: An Analysis of Inter-Repository Package Dependency Problems (AD, TM, MC, PG), pp. 493–504.
- CIAA-2016-FernauK #automaton #exponential #finite
- Problems on Finite Automata and the Exponential Time Hypothesis (HF, AK), pp. 89–100.
- CIAA-2016-Fujiyoshi #algorithm #automaton #multi
- A Practical Algorithm for the Uniform Membership Problem of Labeled Multidigraphs of Tree-Width 2 for Spanning Tree Automata (AF), pp. 101–112.
- CIAA-2016-KhoussainovL #algebra #automaton #finite #infinity
- Decision Problems for Finite Automata over Infinite Algebraic Structures (BK, JL), pp. 3–11.
- DLT-2016-ManeaNS #equation #on the #strict #word
- On the Solvability Problem for Restricted Classes of Word Equations (FM, DN, MLS), pp. 306–318.
- DLT-2016-UezatoM #approach #automaton
- Monoid-Based Approach to the Inclusion Problem on Superdeterministic Pushdown Automata (YU, YM), pp. 393–405.
- FSCD-2016-DudenhefnerMR #unification
- The Intersection Type Unification Problem (AD, MM, JR), p. 16.
- SEFM-2016-Agha #abstraction #analysis #concurrent #modelling #semantics #tool support
- Abstractions, Semantic Models and Analysis Tools for Concurrent Systems: Progress and Open Problems - (Extended Abstract) (GA), pp. 3–8.
- VS-Games-2016-GauthierJ #game studies #learning #research
- Woes of an RCT for Game-Based Learning Research - Past Problems and Potential Solutions (AG, JJ), pp. 1–2.
- CIKM-2016-RajasekaranS #algorithm #performance
- Efficient Algorithms for the Two Locus Problem in Genome-Wide Association Study: Algorithms for the Two Locus Problem (SR, SS), pp. 2305–2310.
- ICML-2016-ChenG #multi #scalability
- Scalable Discrete Sampling as a Multi-Armed Bandit Problem (YC, ZG), pp. 2492–2501.
- ICML-2016-DavidS #algorithm #bound #performance
- PAC Lower Bounds and Efficient Algorithms for The Max K-Armed Bandit Problem (YD, NS), pp. 878–887.
- ICML-2016-HazanLS #on the #optimisation #probability
- On Graduated Optimization for Stochastic Non-Convex Problems (EH, KYL, SSS), pp. 1833–1841.
- ICML-2016-KomiyamaHN #algorithm #bound #performance
- Copeland Dueling Bandit Problem: Regret Lower Bound, Optimal Algorithm, and Computationally Efficient Algorithm (JK, JH, HN), pp. 1235–1244.
- ICML-2016-LimW #approach #permutation
- A Box-Constrained Approach for Hard Permutation Problems (CHL, SW), pp. 2454–2463.
- ICML-2016-LocatelliGC #algorithm
- An optimal algorithm for the Thresholding Bandit Problem (AL, MG, AC), pp. 1690–1698.
- ICML-2016-SimsekAK #why
- Why Most Decisions Are Easy in Tetris - And Perhaps in Other Sequential Decision Problems, As Well (ÖS, SA, AK), pp. 1757–1765.
- ICML-2016-VladymyrovC #scalability
- The Variational Nystrom method for large-scale spectral problems (MV, MÁCP), pp. 211–220.
- ICPR-2016-CardosoMA #analysis #performance
- Plücker correction problem: Analysis and improvements in efficiency (JRC, PM, HA), pp. 2795–2800.
- ICPR-2016-KhelifiM #approach #image #multi #segmentation
- A multi-objective approach based on TOPSIS to solve the image segmentation combination problem (LK, MM), pp. 4220–4225.
- ICPR-2016-LiB #3d #robust
- Selection of robust features for the Cover Source Mismatch problem in 3D steganalysis (ZL0, AGB), pp. 4256–4261.
- ICPR-2016-NienkotterJ #string
- Distance-preserving vector space embedding for the closest string problem (AN, XJ0), pp. 1530–1535.
- ICPR-2016-Norov-ErdeneKSK #classification #locality #multi
- Locality in multi-label classification problems (BNE, MK, LS, KK), pp. 2319–2324.
- ICPR-2016-OsmanliogluOHS #analysis #approximate #performance
- Efficient approximation of labeling problems with applications to immune repertoire analysis (YO, SO, UH, AS), pp. 2410–2415.
- ICPR-2016-Saha0PV #learning #visual notation
- Transfer learning for rare cancer problems via Discriminative Sparse Gaussian Graphical model (BS, SG0, DQP, SV), pp. 537–542.
- ICPR-2016-ValevYK #approach #geometry #pattern matching #pattern recognition #recognition
- A new geometrical approach for solving the supervised pattern recognition problem (VV, NY, AK), pp. 1648–1652.
- ICPR-2016-WeissenbergRDG #np-hard #optimisation
- Dilemma First Search for effortless optimization of NP-hard problems (JW, HR, RD, LVG), pp. 4154–4159.
- KDD-2016-KarLNC0 #online #optimisation #quantifier
- Online Optimization Methods for the Quantification Problem (PK, SL, HN, SC, FS0), pp. 1625–1634.
- MoDELS-2016-KahaniBDC #analysis #eclipse #modelling #tool support #topic
- The problems with eclipse modeling tools: a topic analysis of eclipse forums (NK, MB, JD, JRC), pp. 227–237.
- AdaEurope-2016-Jones #ada #impact analysis #testing
- Addressing the Regression Test Problem with Change Impact Analysis for Ada (AVJ), pp. 61–77.
- POPL-2016-ChatterjeeFNH #algorithm #analysis #probability #source code #termination
- Algorithmic analysis of qualitative and quantitative termination problems for affine probabilistic programs (KC, HF0, PN0, RH), pp. 327–342.
- SAS-2016-MauricaMP #float #linear #on the #ranking
- On the Linear Ranking Problem for Simple Floating-Point Loops (FM, FM, ÉP), pp. 300–316.
- ICSE-2016-LinLZZ #identification #named
- iDice: problem identification for emerging issues (QL, JGL, HZ0, DZ), pp. 214–224.
- ICSE-2016-OizumiGSCZ #design
- Code anomalies flock together: exploring code anomaly agglomerations for locating design problems (WNO, AFG, LdSS, BBPC, YZ), pp. 440–451.
- SLE-2016-KeidelPE #ide
- The IDE portability problem and its solution in Monto (SK, WP, SE), pp. 152–162.
- CASE-2016-AbbatecolaFU #overview
- A review of new approaches for Dynamic Vehicle Routing Problem (LA, MPF, WU), pp. 361–366.
- CASE-2016-Ritt #algorithm #bound #permutation #scheduling
- A branch-and-bound algorithm with cyclic best-first search for the permutation flow shop scheduling problem (MR), pp. 872–877.
- CASE-2016-SundarQRNDV #algorithm #scheduling
- Algorithms for a Satellite Constellation scheduling Problem (KS, JQ, SR, LN, SD, CGV), pp. 373–378.
- CAV-2016-ChenSW #approach #commutative #framework #pipes and filters #transducer
- The Commutativity Problem of the MapReduce Framework: A Transducer-Based Approach (YFC, LS, ZW), pp. 91–111.
- CSL-2016-Barto #constraints #infinity
- Infinite Domain Constraint Satisfaction Problem (LB), p. 1.
- CSL-2016-PakusaSS #polynomial
- Definability of Cai-Fürer-Immerman Problems in Choiceless Polynomial Time (WP, SS, ES), p. 17.
- ICTSS-2016-PatelH #correctness #nondeterminism
- Resolving the Equivalent Mutant Problem in the Presence of Non-determinism and Coincidental Correctness (KP, RMH), pp. 123–138.
- IJCAR-2016-MatsuzakiIKZFKA #benchmark #metric
- Race Against the Teens - Benchmarking Mechanized Math on Pre-university Problems (TM, HI, MK, YZ, RF, JK, HA, NHA), pp. 213–227.
- VMCAI-2016-CrescenzoT #automaton #composition #synthesis
- A General Modular Synthesis Problem for Pushdown Systems (IDC, SLT), pp. 495–513.
- ECSA-2015-BelleEDKM #architecture #polynomial
- The Layered Architecture Recovery as a Quadratic Assignment Problem (ABB, GEB, CD, SK, HM), pp. 339–354.
- WICSA-2015-ZimmermannWKG #architecture #in the cloud #modelling
- Architectural Decision Guidance Across Projects — Problem Space Modeling, Decision Backlog Management and Cloud Computing Knowledge (OZ, LW, HK, TG), pp. 85–94.
- JCDL-2015-KananZMF #big data #learning #summary
- Big Data Text Summarization for Events: A Problem Based Learning Course (TK, XZ, MM, EAF), pp. 87–90.
- JCDL-2015-LeeJP #game studies #video
- The Problem of “Additional Content” in Video Games (JHL, JJ, AP), pp. 237–240.
- SIGMOD-2015-RuchanskyBGGK
- The Minimum Wiener Connector Problem (NR, FB, DGS, FG, NK), pp. 1587–1602.
- VLDB-2015-Balazinska15a #big data #data analysis #industrial #question
- Big Data Research: Will Industry Solve all the Problems? (MB), pp. 2053–2064.
- VLDB-2015-DingSMM #algorithm #framework #named #optimisation
- TOP: A Framework for Enabling Algorithmic Optimizations for Distance-Related Problems (YD, XS, MM, TM), pp. 1046–1057.
- EDM-2015-BahargamEBT #education #personalisation #scheduling
- Personalized Education; Solving a Group Formation and Scheduling Problem for Educational Content (SB, DE, AB, ET), pp. 488–491.
- EDM-2015-EagleBRBAE #behaviour #game studies
- Exploring Problem-Solving Behavior in an Optics Game (ME, RB, ER, TB, JAC, TE), pp. 584–585.
- EDM-2015-EagleHB #estimation #interactive #network #predict
- Interaction Network Estimation: Predicting Problem-Solving Diversity in Interactive Environments (ME, AH, TB), pp. 342–349.
- EDM-2015-JohnPM #detection #graph #question #semantics #similarity #word
- Semantic Similarity Graphs of Mathematics Word Problems: Can Terminology Detection Help? (RJLJ, RJP, TSM), pp. 452–455.
- EDM-2015-ShuteMW
- Measuring Problem Solving Skills in Plants vs. Zombies 2 (VS, GRM, LW), pp. 428–431.
- ITiCSE-2015-Kumar #semantics
- Solving Code-tracing Problems and its Effect on Code-writing Skills Pertaining to Program Semantics (ANK), pp. 314–319.
- MSR-2015-MartinHJSZ #mining
- The App Sampling Problem for App Store Mining (WM, MH, YJ, FS, YZ), pp. 123–133.
- SANER-2015-SassoML #detection
- Misery loves company: CrowdStacking traces to aid problem detection (TDS, AM, ML), pp. 131–140.
- CIAA-2015-Madejski #linear #permutation
- The Membership Problem for Linear and Regular Permutation Languages (GM), pp. 211–223.
- CIAA-2015-NakanishiY #automaton #quantum
- Classical and Quantum Counter Automata on Promise Problems (MN, AY), pp. 224–237.
- CIAA-2015-Prusa #context-free grammar #decidability #multi
- (Un)decidability of the Emptiness Problem for Multi-dimensional Context-Free Grammars (DP), pp. 250–262.
- DLT-2015-BianchiHK #automaton #liveness #on the
- On the Size of Two-Way Reasonable Automata for the Liveness Problem (MPB, JH, IK), pp. 120–131.
- DLT-2015-GainutdinovaY #automaton #probability #quantum
- Unary Probabilistic and Quantum Automata on Promise Problems (AG, AY), pp. 252–263.
- ICALP-v1-2015-BhangaleKS #approximate #constraints
- Simultaneous Approximation of Constraint Satisfaction Problems (AB, SK, SS), pp. 193–205.
- ICALP-v1-2015-BjorklundDH #exponential #random #set #strict
- The Parity of Set Systems Under Random Restrictions with Applications to Exponential Time Problems (AB, HD, TH), pp. 231–242.
- ICALP-v1-2015-BodirskyMM #constraints #integer
- Constraint Satisfaction Problems over the Integers with Successor (MB, BM, AM), pp. 256–267.
- ICALP-v1-2015-DoronT #approximate #graph #on the #probability
- On the Problem of Approximating the Eigenvalues of Undirected Graphs in Probabilistic Logspace (DD, ATS), pp. 419–431.
- ICALP-v1-2015-FominGKM #bound #graph #morphism
- Lower Bounds for the Graph Homomorphism Problem (FVF, AG, ASK, IM), pp. 481–493.
- ICALP-v1-2015-HuangL #approximate #combinator #optimisation #probability
- Approximating the Expected Values for Combinatorial Optimization Problems over Stochastic Points (LH, JL), pp. 910–921.
- ICALP-v1-2015-KozikO #algebra #constraints
- Algebraic Properties of Valued Constraint Satisfaction Problem (MK, JO), pp. 846–858.
- ICALP-v1-2015-KurpiszLM #on the
- On the Hardest Problem Formulations for the 0/1 0 / 1 Lasserre Hierarchy (AK, SL, MM), pp. 872–885.
- ICALP-v1-2015-LiJ
- A PTAS for the Weighted Unit Disk Cover Problem (JL, YJ), pp. 898–909.
- ICALP-v1-2015-MomkeW #algorithm #approximate
- A (2+ε)-Approximation Algorithm for the Storage Allocation Problem (TM, AW), pp. 973–984.
- ICALP-v2-2015-Feldmann #approximate #graph #parametricity
- Fixed Parameter Approximations for k-Center Problems in Low Highway Dimension Graphs (AEF), pp. 588–600.
- ICALP-v2-2015-FiliotMRT #transducer
- Decision Problems of Tree Transducers with Origin (EF, SM, PAR, JMT), pp. 209–221.
- ICALP-v2-2015-KantorK
- Optimal Competitiveness for the Rectilinear Steiner Arborescence Problem (EK, SK), pp. 675–687.
- ICALP-v2-2015-LerouxST #automaton #on the
- On the Coverability Problem for Pushdown Vector Addition Systems in One Dimension (JL, GS, PT), pp. 324–336.
- LATA-2015-BilottaPPR
- Recurrence Relations, Succession Rules, and the Positivity Problem (SB, EP, RP, SR), pp. 499–510.
- LATA-2015-CreignouKMMOV
- Parameterized Enumeration for Modification Problems (NC, RK, AM, JSM, FO, HV), pp. 524–536.
- LATA-2015-DennunzioFMP
- Preimage Problems for Reaction Systems (AD, EF, LM, AEP), pp. 537–548.
- LATA-2015-KrishnaMT #automaton #bound #decidability #reachability #recursion
- Time-Bounded Reachability Problem for Recursive Timed Automata is Undecidable (SNK, LM, AT), pp. 237–248.
- FM-2015-SchneiderLW #modelling #validation
- Model-Based Problem Solving for University Timetable Validation and Improvement (DS, ML, TW), pp. 487–495.
- SEFM-2015-VollingerR #algorithm #certification #distributed
- Certification of Distributed Algorithms Solving Problems with Optimal Substructure (KV, WR), pp. 190–195.
- ICFP-2015-GenevesG #static typing #type system #xquery
- XQuery and static typing: tackling the problem of backward axes (PG, NG), pp. 88–100.
- ICFP-2015-RendelTO #automation #pattern matching
- Automatic refunctionalization to a language with copattern matching: with applications to the expression problem (TR, JT, KO), pp. 269–279.
- DiGRA-2015-Guevara-Villalobos #independence
- Independent gamework and identity: Problems and subjective nuances (OGV).
- DiGRA-2015-SeidmanFK #design #game studies #lessons learnt #prototype
- Failed Games: Lessons Learned from Promising but Problematic Game Prototypes in Designing for Diversity (MS, MF, GFK).
- FDG-2015-NguyenEC #comprehension #game studies #named #visualisation
- Glyph: Visualization Tool for Understanding Problem Solving Strategies in Puzzle Games (THDN, MSEN, AC).
- VS-Games-2015-DonaldMBGB #game studies
- Project Sanitarium: Gaming TB - A Serious Game for a Serious Problem (ID, KAM, JB, SG, RB), pp. 1–8.
- CHI-2015-BorstTR #what
- What Makes Interruptions Disruptive?: A Process-Model Account of the Effects of the Problem State Bottleneck on Task Interruption and Resumption (JPB, NAT, HvR), pp. 2971–2980.
- CHI-2015-LawsonKLFH #design #quantifier
- Problematising Upstream Technology through Speculative Design: The Case of Quantified Cats and Dogs (SWL, BK, CL, TF, LH), pp. 2663–2672.
- DUXU-DD-2015-TarkkanenHR #analysis #testing #usability
- Are We Testing Utility? Analysis of Usability Problem Types (KT, VH, PR), pp. 269–280.
- DUXU-UI-2015-MedolaLBSFP #case study #experience
- Experiences, Problems and Solutions in Computer Usage by Subjects with Tetraplegia (FOM, JL, CGB, AS, AEF, LCP), pp. 131–137.
- HCI-IT-2015-AtroucheID
- A Mashup-Based Application for the Smart City Problematic (AA, DI, BD), pp. 683–694.
- HIMI-IKC-2015-HoriguchiTH #comprehension #concept #physics #sequence #student
- The Effect of Problem Sequence on Students’ Conceptual Understanding in Physics (TH, TT, TH), pp. 313–322.
- HIMI-IKC-2015-MatsudaOHT #analysis #automation #generative #multi #testing #using
- Analysis of Multiple-Choice Tests Through Erroneous Choices Using a Technique of Automatic Problem Generation (NM, HO, TH, HT), pp. 362–369.
- HIMI-IKD-2015-TrevisanPMG #big data #health #industrial #security #visualisation
- Big Data Visualization for Occupational Health and Security Problem in Oil and Gas Industry (DGT, NSP, LM, ACBG), pp. 46–54.
- ICEIS-v1-2015-AwasthiLK #algorithm #linear #sequence #strict
- Un-restricted Common Due-Date Problem with Controllable Processing Times — Linear Algorithm for a Given Job Sequence (AA, JL, OK), pp. 526–534.
- ICEIS-v1-2015-EnriquezLGMC #identification #open data
- Entity Identification Problem in Big and Open Data (JGE, VL, MG, FJDM, MJEC), pp. 404–408.
- ICEIS-v1-2015-NouriDG #algorithm #flexibility #multi #scheduling #search-based
- Genetic Algorithm Combined with Tabu Search in a Holonic Multiagent Model for Flexible Job Shop Scheduling Problem (HEN, OBD, KG), pp. 573–584.
- ICEIS-v1-2015-PecliGPMFTTDFCG #learning #predict #reduction
- Dimensionality Reduction for Supervised Learning in Link Prediction Problems (AP, BG, CCP, CM, FF, FT, JT, MVD, SF, MCC, RRG), pp. 295–302.
- ICEIS-v2-2015-ZoglaMS #analysis #quality #taxonomy
- Analysis of Data Quality Problem Taxonomies (AZ, IM, ES), pp. 445–450.
- CIKM-2015-WangSFLXY #approximate #reduction
- Approximate Truth Discovery via Problem Scale Reduction (XW0, QZS, XSF, XL0, XX, LY), pp. 503–512.
- ECIR-2015-Tutubalina #topic
- Target-Based Topic Model for Problem Phrase Extraction (ET), pp. 271–277.
- ECIR-2015-WangHS0W0 #network #recommendation #social #towards
- Toward the New Item Problem: Context-Enhanced Event Recommendation in Event-Based Social Networks (ZW, PH, LS, KC, SW, GC), pp. 333–338.
- ICML-2015-Abbasi-YadkoriB #crowdsourcing #markov #scalability
- Large-Scale Markov Decision Problems with KL Control Cost and its Application to Crowdsourcing (YAY, PLB, XC, AM), pp. 1053–1062.
- ICML-2015-BlechschmidtGL #approximate #multi #optimisation #parametricity
- Tracking Approximate Solutions of Parameterized Optimization Problems over Multi-Dimensional (Hyper-)Parameter Domains (KB, JG, SL), pp. 438–447.
- ICML-2015-GiguereRLM #algorithm #kernel #predict #string
- Algorithms for the Hard Pre-Image Problem of String Kernels and the General Problem of String Prediction (SG, AR, FL, MM), pp. 2021–2029.
- ICML-2015-KomiyamaHN #analysis #multi #probability
- Optimal Regret Analysis of Thompson Sampling in Stochastic Multi-armed Bandit Problem with Multiple Plays (JK, JH, HN), pp. 1152–1161.
- ICML-2015-MaeharaYK #game studies #multi #perspective
- Budget Allocation Problem with Multiple Advertisers: A Game Theoretic View (TM, AY, KiK), pp. 428–437.
- ICML-2015-SaRO #convergence #matrix #probability
- Global Convergence of Stochastic Gradient Descent for Some Non-convex Matrix Problems (CDS, CR, KO), pp. 2332–2341.
- ICML-2015-ZhouZ
- Safe Subspace Screening for Nuclear Norm Regularized Least Squares Problems (QZ, QZ), pp. 1103–1112.
- KDD-2015-Gomez-Rodriguez #machine learning #modelling #network #probability #research #social
- Diffusion in Social and Information Networks: Research Problems, Probabilistic Models and Machine Learning Methods (MGR, LS), pp. 2315–2316.
- KDD-2015-IitsukaM #optimisation
- Website Optimization Problem and Its Solutions (SI, YM), pp. 447–456.
- KDD-2015-OkumuraST #analysis #classification #incremental #linear
- Quick Sensitivity Analysis for Incremental Data Modification and Its Application to Leave-one-out CV in Linear Classification Problems (SO, YS, IT), pp. 885–894.
- SEKE-2015-KalinowskiSCPF0 #requirements #towards
- Towards Building Knowledge on Causes of Critical Requirements Engineering Problems (MK, ROS, TC, RP, DMF, SW), pp. 1–6.
- SEKE-2015-Wang #metric
- Improved Metrics for Non-Classic Test Prioritization Problems (ZW), pp. 562–566.
- SIGIR-2015-TrevisiolABB #ranking
- Local Ranking Problem on the BrowseGraph (MT, LMA, PB, RB), pp. 173–182.
- ECOOP-2015-FangDX #detection #named #performance
- PerfBlower: Quickly Detecting Memory-Related Performance Problems via Amplification (LF, LD, G(X), pp. 296–320.
- OOPSLA-2015-ToffolaPG #dynamic analysis #performance
- Performance problems you can fix: a dynamic analysis of memoization opportunities (LDT, MP, TRG), pp. 607–622.
- PADL-2015-DymchenkoM
- Declaratively Solving Google Code Jam Problems with Picat (SD, MM), pp. 50–57.
- PPDP-2015-BartakDZ #logic programming #modelling #on the
- On modeling planning problems in tabled logic programming (RB, AD, NFZ), pp. 31–42.
- ESEC-FSE-2015-ZhengMZ #capacity #constraints #identification #process
- A method to identify and correct problematic software activity data: exploiting capacity constraints and data redundancies (QZ, AM, MZ), pp. 637–648.
- ICSE-v1-2015-NistorCRL #detection #named #performance
- CARAMEL: Detecting and Fixing Performance Problems That Have Non-Intrusive Fixes (AN, PCC, CR, SL), pp. 902–912.
- SAC-2015-DymchenkoM #eclipse #prolog
- Declaratively solving tricky google code jam problems with prolog-based ECLiPSe CLP system (SD, MM), pp. 2122–2124.
- SAC-2015-FontineleSSNM #network #physics
- A solution to the MCSP problem considering physical layer degradations in transparent optical networks (AF, IS, ACBS, JMN, FM), pp. 662–664.
- SAC-2015-LeeOL #enterprise
- SSD caching to overcome small write problem of disk-based RAID in enterprise environments (EL, YO, DL), pp. 2047–2053.
- SAC-2015-SilvaMR #algorithm #approach #using
- An approach to the MOGAS initialization problem using an algorithm based on path relinking (TGNdS, JEBM, LSR), pp. 118–124.
- CASE-2015-GiulianiC #optimisation #using
- Derivative-free optimization with use of problem structure: Applications to oil production (CMG, EC), pp. 764–768.
- CASE-2015-Houssin
- An exension of the heap of pieces model for the Cyclic Jobshop Problem (LH), pp. 1182–1187.
- CASE-2015-LiDLZ #approach #composition
- A decomposition approach to colored traveling salesman problems (JL, XD, HL, MZ), pp. 51–56.
- CASE-2015-NguyenLK #composition
- Decomposition techniques for urban consolidation problems (DTN, HCL, AK), pp. 57–62.
- CASE-2015-NouaouriSA #data mining #mining #predict
- Evidential data mining for length of stay (LOS) prediction problem (IN, AS, HA), pp. 1415–1420.
- CASE-2015-ShellshearCBT #algorithm #concurrent #multi #thread
- A multi-threaded memetic packing algorithm for the ISO luggage packing problem (ES, JSC, RB, ST), pp. 1509–1514.
- CASE-2015-ShiLGS
- Production planning for a class of batch processing problem (ZS, PL, HG, LS), pp. 1188–1193.
- CASE-2015-TanakaM #algorithm #bound #strict
- Dominance properties for the unrestricted block relocation problem and their application to a branch-and-bound algorithm (ST, FM), pp. 509–514.
- CASE-2015-ZhaoLH #estimation #flexibility #performance
- Plant flexibility planning: Problem formulation and performance estimation (CZ, JL, NH), pp. 659–664.
- DATE-2015-HuangHC #algorithm #clustering #framework #multi #scalability
- Clustering-based multi-touch algorithm framework for the tracking problem with a large number of points (SLH, SYH, CPC), pp. 719–724.
- PDP-2015-YounessIMO #gpu #implementation #optimisation #performance #satisfiability
- An Efficient Implementation of Ant Colony Optimization on GPU for the Satisfiability Problem (HAY, AI, MM, MO), pp. 230–235.
- ESOP-2015-BattyMNPS #concurrent #programming language #semantics
- The Problem of Programming Language Concurrency Semantics (MB, KM, KN, JPP, PS), pp. 283–307.
- FoSSaCS-2015-HoO
- The Cyclic-Routing UAV Problem is PSPACE-Complete (HMH, JO), pp. 328–342.
- STOC-2015-AaronsonA #named #quantum
- Forrelation: A Problem that Optimally Separates Quantum from Classical Computing (SA, AA), pp. 307–316.
- STOC-2015-AggarwalDRS #using
- Solving the Shortest Vector Problem in 2n Time Using Discrete Gaussian Sampling: Extended Abstract (DA, DD, OR, NSD), pp. 733–742.
- STOC-2015-BraunPZ #combinator
- Inapproximability of Combinatorial Problems via Small LPs and SDPs (GB, SP, DZ), pp. 107–116.
- STOC-2015-FeldmanPV #complexity #on the #random #satisfiability
- On the Complexity of Random Satisfiability Problems with Planted Solutions (VF, WP, SV), pp. 77–86.
- STOC-2015-HenzingerKNS #multi #online
- Unifying and Strengthening Hardness for Dynamic Problems via the Online Matrix-Vector Multiplication Conjecture (MH, SK, DN, TS), pp. 21–30.
- STOC-2015-KesselheimKN #order
- Secretary Problems with Non-Uniform Arrival Order (TK, RDK, RN), pp. 879–888.
- STOC-2015-Nikolov #random
- Randomized Rounding for the Largest Simplex Problem (AN), pp. 861–870.
- CADE-2015-IborraNVY #dependence #termination
- Reducing Relative Termination to Dependency Pair Problems (JI, NN, GV, AY), pp. 163–178.
- ICST-2015-HarmanJZ #challenge #testing
- Achievements, Open Problems and Challenges for Search Based Software Testing (MH, YJ, YZ), pp. 1–12.
- ICST-2015-PanichellaKT #branch #optimisation
- Reformulating Branch Coverage as a Many-Objective Optimization Problem (AP, FMK, PT), pp. 1–10.
- LICS-2015-BokerHO
- The Target Discounted-Sum Problem (UB, TAH, JO), pp. 750–761.
- LICS-2015-ClementeR #multi #worst-case
- Multidimensional beyond Worst-Case and Almost-Sure Problems for Mean-Payoff Objectives (LC, JFR), pp. 257–268.
- LICS-2015-DalmauEHLR #complexity
- Descriptive Complexity of List H-Coloring Problems in Logspace: A Refined Dichotomy (VD, LE, PH, BL, AR), pp. 487–498.
- LICS-2015-GasconTS #polynomial #unification
- One Context Unification Problems Solvable in Polynomial Time (AG, AT, MSS), pp. 499–510.
- LICS-2015-KlinKOT #constraints #finite
- Locally Finite Constraint Satisfaction Problems (BK, EK, JO, ST), pp. 475–486.
- VMCAI-2015-RandourRS #probability
- Variations on the Stochastic Shortest Path Problem (MR, JFR, OS), pp. 1–18.
- ECSA-2014-AbukwaikTR #architecture #information management
- Interoperability-Related Architectural Problems and Solutions in Information Systems: A Scoping Study (HA, DT, HDR), pp. 308–323.
- SIGMOD-2014-MottinMRDPV #interactive #named #query
- IQR: an interactive query relaxation system for the empty-answer problem (DM, AM, SBR, GD, TP, YV), pp. 1095–1098.
- VLDB-2014-WuCHKLX #graph
- Path Problems in Temporal Graphs (HW, JC, SH, YK, YL, YX), pp. 721–732.
- VLDB-2014-YanCXLNB #algorithm #graph #performance
- Pregel Algorithms for Graph Connectivity Problems with Performance Guarantees (DY, JC, KX, YL, WN, YB), pp. 1821–1832.
- EDM-2014-EagleB #approach #data-driven #difference
- Exploring Differences in Problem Solving with Data-Driven Approach Maps (ME, TB), pp. 76–83.
- EDM-2014-GuerraSLB #student
- The Problem Solving Genome: Analyzing Sequential Patterns of Student Work with Parameterized Exercises (JG, SS, YRL, PB), pp. 153–160.
- EDM-2014-HernandoGSAN #modelling #student #towards
- Towards IRT-based student modeling from problem solving steps (MH, EG, SAS, EA, SN), pp. 423–424.
- EDM-2014-NiznanPR #detection #using
- Using Problem Solving Times and Expert Opinion to Detect Skills (JN, RP, JR), pp. 433–434.
- EDM-2014-PeddycordHB #generative #programming #using
- Generating Hints for Programming Problems Using Intermediate Output (BWPI, AH, TB), pp. 92–98.
- EDM-2014-TothRGW #assessment #education #student
- Discovering Students' Complex Problem Solving Strategies in Educational Assessment (KT, HR, SG, SW), pp. 225–228.
- ITiCSE-2014-MI14a #principle #using
- Problem-solving using the extremality principle (JM, SI), pp. 87–92.
- ITiCSE-2014-WartVP #design #learning #social
- Apps for social justice: motivating computer science learning with design and real-world problem solving (SVW, SV, TSP), pp. 123–128.
- CSMR-WCRE-2014-BaggeZ
- International workshop on open and original problems in software language engineering (AHB, VZ), p. 478.
- CSMR-WCRE-2014-DietrichJB #empirical #evolution #java #library #source code
- Broken promises: An empirical study into evolution problems in Java programs caused by library upgrades (JD, KJ, PB), pp. 64–73.
- MSR-2014-BellerBZJ #code review #open source #question
- Modern code reviews in open-source projects: which problems do they fix? (MB, AB, AZ, EJ), pp. 202–211.
- DLT-J-2013-BertoniCD14 #automaton #context-free grammar #decidability #on the #quantum
- On the Decidability of the Intersection Problem for Quantum Automata and Context-Free Languages (AB, CC, FD), pp. 1065–1082.
- DLT-J-2013-DayRS14 #on the
- On the Dual Post Correspondence Problem (JDD, DR, JCS), pp. 1033–1048.
- AFL-2014-Loding #automaton #infinity #word
- Decision Problems for Deterministic Pushdown Automata on Infinite Words (CL), pp. 55–73.
- AFL-2014-Maneth #equivalence #overview #transducer
- Equivalence Problems for Tree Transducers: A Brief Survey (SM), pp. 74–93.
- CIAA-2014-Ibarra #ambiguity #on the #transducer
- On the Ambiguity, Finite-Valuedness, and Lossiness Problems in Acceptors and Transducers (OHI), pp. 211–225.
- DLT-2014-Berlinkov #algorithm #automaton #on the
- On Two Algorithmic Problems about Synchronizing Automata — (MVB), pp. 61–67.
- ICALP-v1-2014-DattaHK #complexity #reachability
- Dynamic Complexity of Directed Reachability and Other Problems (SD, WH, RK), pp. 356–367.
- ICALP-v1-2014-GolovnevKM #approach #product line
- Families with Infants: A General Approach to Solve Hard Partition Problems (AG, ASK, IM), pp. 551–562.
- ICALP-v1-2014-HajiaghayiLP #algorithm #online
- Near-Optimal Online Algorithms for Prize-Collecting Steiner Problems (MH, VL, DP), pp. 576–587.
- ICALP-v1-2014-IvanyosKQSS #complexity #constraints #fault #on the
- On the Complexity of Trial and Error for Constraint Satisfaction Problems (GI, RK, YQ, MS, AS), pp. 663–675.
- ICALP-v1-2014-KlauckP #algorithm #interactive #streaming
- An Improved Interactive Streaming Algorithm for the Distinct Elements Problem (HK, VP), pp. 919–930.
- ICALP-v1-2014-Tzameret #algorithm #random #satisfiability
- Sparser Random 3-SAT Refutation Algorithms and the Interpolation Problem — (IT), pp. 1015–1026.
- ICALP-v2-2014-EmekLUW #finite #state machine
- Solving the ANTS Problem with Asynchronous Finite State Machines (YE, TL, JU, RW), pp. 471–482.
- ICALP-v2-2014-KantorK #symmetry
- Optimal Competitiveness for Symmetric Rectilinear Steiner Arborescence and Related Problems (EK, SK), pp. 520–531.
- ICALP-v2-2014-NikzadR #algorithm #approximate #multi
- Sending Secrets Swiftly: Approximation Algorithms for Generalized Multicast Problems (AN, RR), pp. 568–607.
- ICALP-v2-2014-OuaknineW #linear #on the #sequence
- On the Positivity Problem for Simple Linear Recurrence Sequences, (JO, JW), pp. 318–329.
- LATA-2014-BoyarKLL #on the
- On the List Update Problem with Advice (JB, SK, KSL, ALO), pp. 210–221.
- LATA-2014-Cerny #composition #morphism #multi
- Solutions to the Multi-dimensional Equal Powers Problem Constructed by Composition of Rectangular Morphisms (AC), pp. 273–284.
- LATA-2014-Gysel #algorithm
- Minimal Triangulation Algorithms for Perfect Phylogeny Problems (RG), pp. 421–432.
- LATA-2014-IbarraR #on the
- On the Parikh Membership Problem for FAs, PDAs, and CMs (OHI, BR), pp. 14–31.
- LATA-2014-Vorel #automaton #complexity #word
- Complexity of a Problem Concerning Reset Words for Eulerian Binary Automata (VV), pp. 576–587.
- AIIDE-2014-BlackfordL #game studies #multi #order #realtime
- The Real-Time Strategy Game Multi-Objective Build Order Problem (JB, GBL).
- CHI-PLAY-2014-VasalouKGB
- Problematizing cultural appropriation (AV, RK, DG, LB), pp. 267–276.
- CIG-2014-EdelkampG #adaptation #physics #policy
- Solving Physical Traveling Salesman Problems with policy adaptation (SE, CG), pp. 1–8.
- FDG-2014-Tuite #game studies #named
- GWAPs: Games with a problem (KT).
- GT-VMT-2014-ZambonR #towards
- Solving the N-Queens Problem with GROOVE — Towards a Compendium of Best Practices (EZ, AR).
- ICGT-2014-RidderR #morphism
- The Subgraph Isomorphism Problem on a Class of Hyperedge Replacement Languages (HNdR, NdR), pp. 192–206.
- CSCW-2014-PineM #logic
- Institutional logics of the EMR and the problem of “perfect” but inaccurate accounts (KHP, MM), pp. 283–294.
- CSCW-2014-TausczikKK #case study #collaboration
- Collaborative problem solving: a study of MathOverflow (YRT, AK, REK), pp. 355–367.
- HIMI-AS-2014-HirashimaYH #learning #word
- Triplet Structure Model of Arithmetical Word Problems for Learning by Problem-Posing (TH, SY, YH), pp. 42–50.
- HIMI-AS-2014-KoyamaYN #design #development #evaluation #research
- Research on User Involvement in Automobile Design Development — Focusing on the Problems of Design Evaluation (NK, MY, MN), pp. 184–192.
- HIMI-DE-2014-TanikawaSKF #design #process #usability #verification
- Problems in Usability Improvement Activity by Software Engineers — Consideration through Verification Experiments for Human- Centered Design Process Support Environment (YT, HS, HK, SF), pp. 641–651.
- ICEIS-v1-2014-FaheemK #algorithm #architecture #case study #framework #multi
- A Multiagent-based Framework for Solving Computationally Intensive Problems on Heterogeneous Architectures — Bioinformatics Algorithms as a Case Study (HMF, BKR), pp. 526–533.
- ICEIS-v1-2014-HaddadCSM #algorithm #heuristic #named #parallel #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.
- ICEIS-v1-2014-NoelMC #algorithm #scheduling
- Evolutionary Algorithms Applied to Agribusiness Scheduling Problem (AN, JMJ, AAC), pp. 489–496.
- ICEIS-v1-2014-RezendeJC #communication #workflow
- Possibilistic Interorganizational Workflow Net for the Recovery Problem Concerning Communication Failures (LPdR, SJ, JC), pp. 432–439.
- ICEIS-v1-2014-SilvaSMMS #branch #design #heuristic #network
- A Heuristic Procedure with Local Branching for the Fixed Charge Network Design Problem with User-optimal Flow (PHGS, LGS, CAdJM, PYPM, ES), pp. 384–394.
- ICEIS-v1-2014-SilveiraCC #case study
- A Problem-solving Agent to Test Rational Agents — A Case Study with Reactive Agents (FRdVS, GALdC, MIC), pp. 505–513.
- CIKM-2014-SeolJYCL #summary
- A Problem-Action Relation Extraction Based on Causality Patterns of Clinical Events in Discharge Summaries (JWS, SHJ, WY, JC, KSL), pp. 1971–1974.
- ICML-c1-2014-ChenLL #multi #online
- Boosting with Online Binary Learners for the Multiclass Bandit Problem (STC, HTL, CJL), pp. 342–350.
- ICML-c1-2014-GopalanMM #online
- Thompson Sampling for Complex Online Problems (AG, SM, YM), pp. 100–108.
- ICML-c1-2014-LajugieBA #clustering #learning #metric
- Large-Margin Metric Learning for Constrained Partitioning Problems (RL, FRB, SA), pp. 297–305.
- ICML-c2-2014-DefazioDC #big data #incremental #named #performance
- Finito: A faster, permutable incremental gradient method for big data problems (AD, JD, TSC), pp. 1125–1133.
- ICML-c2-2014-LiuD #learning #set
- Learnability of the Superset Label Learning Problem (LPL, TGD), pp. 1629–1637.
- ICML-c2-2014-LiZ #higher-order #learning
- High Order Regularization for Semi-Supervised Learning of Structured Output Problems (YL, RSZ), pp. 1368–1376.
- ICML-c2-2014-MalekAB #linear #markov #programming #scalability
- Linear Programming for Large-Scale Markov Decision Problems (AM, YAY, PLB), pp. 496–504.
- ICML-c2-2014-RavanbakhshSFG #graph
- Min-Max Problems on Factor Graphs (S(R, CS, BJF, RG), pp. 1035–1043.
- ICML-c2-2014-ZoghiWMR #bound
- Relative Upper Confidence Bound for the K-Armed Dueling Bandit Problem (MZ, SW, RM, MdR), pp. 10–18.
- ICPR-2014-MasselliZ #approach #geometry #performance
- A New Geometric Approach for Faster Solving the Perspective-Three-Point Problem (AM, AZ), pp. 2119–2124.
- ICPR-2014-YingWMYZ #using
- The Perspective-3-Point Problem When Using a Planar Mirror (XY, GW, XM, SY, HZ), pp. 4033–4037.
- KDD-2014-Aggarwal #classification
- The setwise stream classification problem (CCA), pp. 432–441.
- KDD-2014-AmatriainM #recommendation #tutorial
- The recommender problem revisited: morning tutorial (XA, BM), p. 1971.
- KDD-2014-XuL #behaviour #learning
- Product selection problem: improve market share by learning consumer behavior (SX, JCSL), pp. 851–860.
- KEOD-2014-AkamaN
- Solving Query-answering Problems with If-and-Only-If Formulas (KA, EN), pp. 333–344.
- KEOD-2014-HarzallahBGK #automation #experience #ontology #quality
- Ontology Quality Problems — An Experience with Automatically Generated Ontologies (MH, GB, TG, PK), pp. 120–129.
- KMIS-2014-FrancoisMA #communication #design #email #traceability #using
- Discovering Problem-Solving Knowledge in Business Emails — Traceability in Software Design Using Computer Mediated Communication (RF, NM, HA), pp. 186–193.
- KMIS-2014-Mustonen-Ollila #case study #information management
- Knowledge Management Problems in Healthcare — A Case Study based on the Grounded Theory (EMO, HN, AV), pp. 15–26.
- KMIS-2014-NyerwanireMVH #case study #experience #information management
- Knowledge Management Problems in Hospital Work — A Case Study on Experiences in the Obstetrics and Gynaecology Department (HN, EMO, AV, JH), pp. 261–267.
- KR-2014-BaierMM
- Diagnostic Problem Solving via Planning with Ontic and Epistemic Goals (JAB, BM, SAM).
- KR-2014-HaanS #complexity #reasoning
- The Parameterized Complexity of Reasoning Problems Beyond NP (RdH, SS).
- MLDM-2014-OtteLK #memory management #network #pattern matching #pattern recognition #recognition
- Investigating Long Short-Term Memory Networks for Various Pattern Recognition Problems (SO, ML, DK), pp. 484–497.
- RecSys-2014-Amatriain #recommendation #revisited
- The recommender problem revisited (XA), pp. 397–398.
- SEKE-2014-FuadD #design #development #interactive #mobile
- Design and Development of a Mobile Classroom Response Software for Interactive Problem Solving (MMF, DD), pp. 49–52.
- OOPSLA-2014-SongL #debugging #performance #statistics
- Statistical debugging for real-world performance problems (LS, SL), pp. 561–578.
- REFSQ-2014-AlebrahimFHM #analysis #interactive #requirements
- Problem-Based Requirements Interaction Analysis (AA, SF, MH, RM), pp. 200–215.
- REFSQ-2014-NairVMTdB #analysis #safety #traceability
- Safety Evidence Traceability: Problem Analysis and Model (SN, JLdlV, AM, GT, LdlB, FB), pp. 309–324.
- FSE-2014-GulwaniRZ #feedback #generative #performance #programming
- Feedback generation for performance problems in introductory programming assignments (SG, IR, FZ), pp. 41–51.
- ICSE-2014-Monperrus #automation #evaluation #generative #overview
- A critical review of “automatic patch generation learned from human-written patches”: essay on the problem statement and the evaluation of automatic software repair (MM), pp. 234–242.
- ICSE-2014-VakilianJ #refactoring #usability
- Alternate refactoring paths reveal usability problems (MV, REJ), pp. 1106–1116.
- SAC-2014-GeorgiadisP #algorithm #online #scheduling #smarttech
- Dealing with storage without forecasts in smart grids: problem transformation and online scheduling algorithm (GG, MP), pp. 518–524.
- SAC-2014-LoulergueRTLH #parallel
- Formal derivation and extraction of a parallel program for the all nearest smaller values problem (FL, SR, JT, JL, ZH), pp. 1577–1584.
- SAC-2014-PotocnikCS #debugging #named #scala
- Linter: a tool for finding bugs and potential problems in scala code (MP, UC, BS), pp. 1615–1616.
- CASE-2014-DengWW #algorithm #distributed #scheduling
- A competitive memetic algorithm for the distributed flow shop scheduling problem (JD, LW, SW), pp. 107–112.
- CASE-2014-GaoLWA #monitoring #petri net #sequence #using
- A monitor solution to enforce legal transition firing sequences problems by using Petri nets (XG, ZL, AW, AMAA), pp. 419–424.
- CASE-2014-GunawanNPL #hybrid #metaheuristic #polynomial
- Hybrid metaheuristics for solving the quadratic assignment problem and the generalized quadratic assignment problem (AG, KMN, KLP, HCL), pp. 119–124.
- CASE-2014-HaoLGC #effectiveness #flexibility #markov #network #nondeterminism #scheduling
- An effective Markov network based EDA for flexible job shop scheduling problems under uncertainty (XCH, LL, MG, CFC), pp. 131–136.
- CASE-2014-Murakami #approach #generative #multi
- A column generation approach for the multi-vehicle covering tour problem (KM), pp. 1063–1068.
- CASE-2014-TanakaT #algorithm #bound #performance
- A faster branch-and-bound algorithm for the block relocation problem (ST, KT), pp. 7–12.
- CASE-2014-WangCG #algorithm #constraints #estimation #hybrid #multi #scheduling
- Hybrid estimation of distribution algorithm with multiple subpopulations for semiconductor manufacturing scheduling problem with limited waiting-time constraint (HKW, CFC, MG), pp. 101–106.
- CASE-2014-WangW #algorithm #estimation #scheduling #testing
- Compact estimation of distribution algorithm for semiconductor final testing scheduling problem (SW, LW), pp. 113–118.
- CASE-2014-YuanLJ #health #probability #scheduling
- Home health care crew scheduling and routing problem with stochastic service times (BY, RL, ZJ), pp. 564–569.
- CGO-2014-SureshS #algorithm #automation #detection #fault #grid
- Automated Algorithmic Error Resilience for Structured Grid Problems Based on Outlier Detection (AS, JS), p. 240.
- DATE-2014-ZhangYW #analysis #performance
- Efficient high-sigma yield analysis for high dimensional problems (MZ, ZY, YW), pp. 1–6.
- PDP-2014-AudemardHJP #approach #distributed #effectiveness #satisfiability
- An Effective Distributed D&C Approach for the Satisfiability Problem (GA, BH, SJ, CP), pp. 183–187.
- PDP-2014-FabbroTP #algorithm #parallel
- A Parallel Algorithm for the Best k-Mismatches Alignment Problem (CDF, FT, AP), pp. 586–589.
- PDP-2014-ItoF #analysis #hardware #resource management #using
- An Experimental Analysis for Hardware Resource Management Using a New Strip Packing Problem (RI, NF), pp. 360–364.
- FoSSaCS-2014-AntonopoulosGHKO #induction #logic
- Foundations for Decision Problems in Separation Logic with General Inductive Predicates (TA, NG, CH, MIK, JO), pp. 411–425.
- FoSSaCS-2014-ErbaturKMMNR #on the #symmetry #unification
- On Asymmetric Unification and the Combination Problem in Disjoint Theories (SE, DK, AMM, CM, PN, CR), pp. 274–288.
- STOC-2014-AndoniNOY #algorithm #geometry #graph #parallel
- Parallel algorithms for geometric graph problems (AA, AN, KO, GY), pp. 574–583.
- STOC-2014-EneV #algorithm #approximate #bound #design #network #requirements
- Improved approximation algorithms for degree-bounded network design problems with node connectivity requirements (AE, AV), pp. 754–763.
- STOC-2014-KawarabayashiKK #graph #grid #theorem
- An excluded half-integral grid theorem for digraphs and the directed disjoint paths problem (KiK, YK, SK), pp. 70–78.
- TACAS-2014-ReinekeT #modelling #multi
- Basic Problems in Multi-View Modeling (JR, ST), pp. 217–232.
- ICLP-J-2014-BartakZ #logic programming #using
- Using Tabled Logic Programming to Solve the Petrobras Planning Problem (RB, NFZ), pp. 697–710.
- ISSTA-2014-NistorR #developer #named #performance #predict #smarttech
- SunCat: helping developers understand and predict performance problems in smartphone applications (AN, LR), pp. 282–292.
- LICS-CSL-2014-GottlobM #bound #logic
- Achieving new upper bounds for the hypergraph duality problem through logic (GG, EM), p. 10.
- LICS-CSL-2014-KlinLOT #complexity #constraints #turing machine
- Turing machines with atoms, constraint satisfaction problems, and descriptive complexity (BK, SL, JO, ST), p. 10.
- SAT-2014-CreusFG #automation #evaluation #reduction
- Automatic Evaluation of Reductions between NP-Complete Problems (CC, PF, GG), pp. 415–421.
- VMCAI-2014-BozgaIK #integer #safety #source code
- Safety Problems Are NP-complete for Flat Integer Programs with Octagonal Loops (MB, RI, FK), pp. 242–261.
- ICDAR-2013-BreslerPH #modelling #recognition
- Modeling Flowchart Structure Recognition as a Max-Sum Problem (MB, DP, VH), pp. 1215–1219.
- ICDAR-2013-KhanKS #identification #question #verification
- Can Signature Biometrics Address Both Identification and Verification Problems? (SHK, ZK, FS), pp. 981–985.
- JCDL-2013-GodoiTCGFFF #ambiguity #approach #feedback
- A relevance feedback approach for the author name disambiguation problem (TAG, RdST, AMBRC, MAG, AAF, WF, EAF), pp. 209–218.
- VLDB-2013-KornSSY #on the
- On Repairing Structural Problems In Semi-structured Data (FK, BS, DS, SY), pp. 601–612.
- VLDB-2013-MottinMRDPV #framework #optimisation #probability
- A Probabilistic Optimization Framework for the Empty-Answer Problem (DM, AM, SBR, GD, TP, YV), pp. 1762–1773.
- VLDB-2013-TranBD #big data #design #query
- Designing Query Optimizers for Big Data Problems of The Future (NT, SB, JD), pp. 1168–1169.
- CSEET-2013-KumarW #testing
- Guidance for exploratory testing through problem frames (SK, CW), pp. 284–288.
- CSEET-2013-RibaudS #cost analysis #information management #learning
- The cost of problem-based learning: An example in information systems engineering (VR, PS), pp. 259–263.
- ITiCSE-2013-Kumar #case study
- A study of the influence of code-tracing problems on code-writing skills (ANK), pp. 183–188.
- ITiCSE-2013-Trakhtenbrot #algorithm #analysis #complexity #concept #student
- Students misconceptions in analysis of algorithmic and computational complexity of problems (MT), pp. 353–354.
- ICPC-2013-ZhangH #api
- Extracting problematic API features from forum discussions (YZ, DH), pp. 142–151.
- ICSM-2013-KrishnanT #optimisation #refactoring
- Refactoring Clones: An Optimization Problem (GPK, NT), pp. 360–363.
- MSR-2013-DullemondGSD #distributed #microblog
- Fixing the “out of sight out of mind” problem: one year of mood-based microblogging in a distributed software team (KD, BvG, MADS, AvD), pp. 267–276.
- WCRE-2013-BaggeZ
- Workshop on open and original problems in software language engineering (AHB, VZ), pp. 493–494.
- CIAA-2013-IbarraR
- Some Decision Problems Concerning NPDAs, Palindromes, and Dyck Languages (OHI, BR), pp. 193–207.
- DLT-2013-BertoniCD #automaton #context-free grammar #decidability #finite #linear #quantum
- Quantum Finite Automata and Linear Context-Free Languages: A Decidable Problem (AB, CC, FD), pp. 82–93.
- DLT-2013-DayRS #on the
- On the Dual Post Correspondence Problem (JDD, DR, JCS), pp. 167–178.
- DLT-2013-LucaPZ #word
- A Coloring Problem for Sturmian and Episturmian Words (AdL, EVP, LQZ), pp. 191–202.
- ICALP-v1-2013-BateniHL #algorithm #approximate
- Improved Approximation Algorithms for (Budgeted) Node-Weighted Steiner Problems (MB, MH, VL), pp. 81–92.
- ICALP-v1-2013-BienkowskiBCDNSSY #algorithm #approximate
- Approximation Algorithms for the Joint Replenishment Problem with Deadlines (MB, JB, MC, NBD, TN, MS, GS, NEY), pp. 135–147.
- ICALP-v1-2013-BodlaenderCKN #algorithm #exponential
- Deterministic Single Exponential Time Algorithms for Connectivity Problems Parameterized by Treewidth (HLB, MC, SK, JN), pp. 196–207.
- ICALP-v1-2013-MuchaS #scheduling #symmetry
- No-Wait Flowshop Scheduling Is as Hard as Asymmetric Traveling Salesman Problem (MM, MS), pp. 769–779.
- ICALP-v1-2013-SviridenkoW #scalability #set
- Large Neighborhood Local Search for the Maximum Set Packing Problem (MS, JW), pp. 792–803.
- ICALP-v2-2013-Albers #scheduling
- Recent Advances for a Classical Scheduling Problem (SA), pp. 4–14.
- ICALP-v2-2013-AlurR
- Decision Problems for Additive Regular Functions (RA, MR), pp. 37–48.
- ICALP-v2-2013-Worrell #automaton #equivalence #finite #multi
- Revisiting the Equivalence Problem for Finite Multitape Automata (JW), pp. 422–433.
- LATA-2013-AlurKTY #complexity #graph #on the
- On the Complexity of Shortest Path Problems on Discounted Cost Graphs (RA, SK, KT, YY), pp. 44–55.
- LATA-2013-Blanchet-SadriL #word
- Suffix Trees for Partial Words and the Longest Common Compatible Prefix Problem (FBS, JL), pp. 165–176.
- LATA-2013-Cai #complexity
- Complexity Dichotomy for Counting Problems (JYC), pp. 1–11.
- LATA-2013-FernauHV #analysis #automaton #multi
- A Multivariate Analysis of Some DFA Problems (HF, PH, YV), pp. 275–286.
- ICFP-2013-SculthorpeBGG
- The constrained-monad problem (NS, JB, GG, AG), pp. 287–298.
- AIIDE-2013-Ontanon #combinator #game studies #multi #realtime
- The Combinatorial Multi-Armed Bandit Problem and Its Application to Real-Time Strategy Games (SO).
- CIG-2013-PowleyWC13a #heuristic #monte carlo #multi #physics
- Monte Carlo Tree Search with macro-actions and heuristic route planning for the Multiobjective Physical Travelling Salesman Problem (EJP, DW, PIC), pp. 1–8.
- CIG-2013-RobertsL #game studies
- Measuring interestingness of continuous game problems (SAR, SML), pp. 1–8.
- CHI-2013-HaraLF #artificial reality #crowdsourcing #identification
- Combining crowdsourcing and google street view to identify street-level accessibility problems (KH, VL, JF), pp. 631–640.
- DHM-HB-2013-LundhBMP #design #visualisation
- Visualizing Design Problems and Solutions of Workstations on Ships (ML, MB, SM, JP), pp. 252–260.
- DHM-SET-2013-BusogiKSRYK #behaviour
- Bayesian Affordance-Based Agent Model for Wayfinding Behaviors in Evacuation Problems (MB, NK, DS, HBR, AY, DK), pp. 297–306.
- DHM-SET-2013-SaparovaBLKMY #health #how #information management #question #usability #what
- Usability Problems in Patient- and Clinician-Oriented Health Information Systems: What Are They and How Do They Differ? (DS, JB, YL, FK, YM, BY), pp. 276–285.
- HCI-UC-2013-KellenCF #diagrams #performance #probability
- Improving User Performance in Conditional Probability Problems with Computer-Generated Diagrams (VK, SSC, XF), pp. 183–192.
- HCI-UC-2013-KobayashiYOO #community #people
- The Present Condition and Problems for Elderly People Participating in Communities (NK, SY, KO, AO), pp. 307–313.
- HIMI-LCCB-2013-YamamotoKYMH #learning #online
- Learning by Problem-Posing with Online Connected Media Tablets (SY, TK, YY, KM, TH), pp. 165–174.
- OCSC-2013-Popescu13b #recommendation
- Group Recommender Systems as a Voting Problem (GP), pp. 412–421.
- ICEIS-v1-2013-AlvesL
- Solving Planning Problems with LRTA* (RMFA, CRL), pp. 475–481.
- ICEIS-v1-2013-PiazzaR #implementation #modelling #multi
- Bridging the Gap between Multidimensional Business Problem Formulation and the Implementation of Multidimensional Data Models (FP, FR), pp. 79–87.
- ICEIS-v1-2013-SimrinAD #heuristic #using
- A Lagrangian Relaxation based Heuristic for the Static Berth Allocation Problem using the Cutting Plane Method (ASS, NNA, AHD), pp. 565–569.
- ICEIS-v2-2013-DjuanaXLJC #ontology #recommendation
- An Ontology-based Method for Sparsity Problem in Tag Recommendation (ED, YX, YL, AJ, CC), pp. 467–474.
- ICEIS-v3-2013-SunkleKR #architecture #enterprise #modelling
- Intentional Modeling for Problem Solving in Enterprise Architecture (SS, VK, SR), pp. 267–274.
- ECIR-2013-PCK #query #repository
- Query Suggestions for Textual Problem Solution Repositories (DP, SC, DK), pp. 569–581.
- ICML-c1-2013-AbernethyAKD #learning #scalability
- Large-Scale Bandit Problems and KWIK Learning (JA, KA, MK, MD), pp. 588–596.
- ICML-c2-2013-GongZLHY #algorithm #optimisation
- A General Iterative Shrinkage and Thresholding Algorithm for Non-convex Regularized Optimization Problems (PG, CZ, ZL, JH, JY), pp. 37–45.
- ICML-c2-2013-WangK13a #approach #message passing
- Subproblem-Tree Calibration: A Unified Approach to Max-Product Message Passing (HW, DK), pp. 190–198.
- ICML-c3-2013-GrosshansSBS #game studies
- Bayesian Games for Adversarial Regression Problems (MG, CS, MB, TS), pp. 55–63.
- ICML-c3-2013-MemisevicE #invariant #learning
- Learning invariant features by harnessing the aperture problem (RM, GE), pp. 100–108.
- KDD-2013-Mu0ZT #probability #scalability
- Constrained stochastic gradient descent for large-scale least squares problem (YM, WD, TZ, DT), pp. 883–891.
- KDD-2013-Neumann #big data #using
- Using “big data” to solve “small data” problems (CN), p. 1140.
- KDD-2013-YangWFZWY #algorithm #multi #performance
- An efficient ADMM algorithm for multidimensional anisotropic total variation regularization problems (SY, JW, WF, XZ, PW, JY), pp. 641–649.
- KDIR-KMIS-2013-ZhouNL #case study #collaboration
- Mitigating Barriers to Patient-centred Knowledge Sharing — A Case-study of Knowledge Sharing Problems in the Collaboration of Traditional and Western Practitioners in Chinese Hospitals (LZ, MBN, WL), pp. 298–307.
- KEOD-2013-AkamaN #proving
- Embedding Proof Problems into Query-answering Problems and Problem Solving by Equivalent Transformation (KA, EN), pp. 253–260.
- MLDM-2013-PrieditisL #bound #classification #performance #using
- When Classification becomes a Problem: Using Branch-and-Bound to Improve Classification Efficiency (AP, ML), pp. 466–480.
- RecSys-2013-AzariaKR #multi
- A system for advice provision in multiple prospectselection problems (AA, SK, AR), pp. 311–314.
- SEKE-2013-BelleEDM #architecture #optimisation #question
- The Layered Architecture revisited: Is it an Optimization Problem? (ABB, GEB, CD, HM), pp. 344–349.
- SEKE-2013-BurnayJF #matter #requirements #what #why
- Context Factors: What they are and why they matter for Requirements Problems (CB, IJ, SF), pp. 30–35.
- SEKE-2013-JanesMSS #analysis #programming #requirements
- Domain Analysis in Combination with Extreme Programming toAddress Requirements Volatility Problems (AJ, SM, AS, GS), pp. 226–231.
- SEKE-2013-SilvaOL #declarative #explosion #modelling #process
- A Solution to the State Space Explosion Problem in Declarative Business Process Modeling (NCS, CALO, RMFL), pp. 26–29.
- MoDELS-2013-WhittleHRBH #industrial #modelling #question #tool support
- Industrial Adoption of Model-Driven Engineering: Are the Tools Really the Problem? (JW, JH, MR, HB, RH), pp. 1–17.
- Onward-2013-ValleeWZFK #modelling #reasoning #security
- Usable security as a static-analysis problem: modeling and reasoning about user permissions in social-sharing systems (HQdlV, JMW, WZ, KF, SK), pp. 1–16.
- OOPSLA-2013-BaoZ #detection #execution #float #on the fly
- On-the-fly detection of instability problems in floating-point program execution (TB, XZ), pp. 817–832.
- POPL-2013-Ben-AmramG #constraints #integer #linear #on the #ranking
- On the linear ranking problem for integer linear-constraint loops (AMBA, SG), pp. 51–62.
- PPDP-2013-MatsudaW #approach #bidirectional #for free #runtime
- Bidirectionalization for free with runtime recording: or, a light-weight approach to the view-update problem (KM, MW), pp. 297–308.
- REFSQ-2013-JantunenHG #challenge
- Adjusting to Increasing Product Management Problems: Challenges and Improvement Proposals in One Software Company (SJ, KH, DCG), pp. 386–400.
- ASE-2013-XiaoLXT #execution #generative #symbolic computation #testing
- Characteristic studies of loop problems for structural test generation via symbolic execution (XX, SL, TX, NT), pp. 246–256.
- ICSE-2013-Carvalho #comprehension #concept #ontology #tool support
- An ontology toolkit for problem domain concept location in program comprehension (NRC), pp. 1415–1418.
- ICSE-2013-NetoCLGM #approach #named #programming #student #testing
- POPT: a problem-oriented programming and testing approach for novice students (VLN, RC, LL, DSG, APM), pp. 1099–1108.
- ICSE-2013-NistorSML #data access #detection #named #performance
- Toddler: detecting performance problems via similar memory-access patterns (AN, LS, DM, SL), pp. 562–571.
- ICSE-2013-PastoreMG #c #c++ #debugging #named
- RADAR: a tool for debugging regression problems in C/C++ software (FP, LM, AG), pp. 1335–1338.
- ICSE-2013-WertHH #automation #performance
- Supporting swift reaction: automatically uncovering performance problems by systematic experiments (AW, JH, LH), pp. 552–561.
- SAC-2013-FariaGC #algorithm #data type #detection #multi
- Novelty detection algorithm for data streams multi-class problems (ERF, JG, ACPLFC), pp. 795–800.
- SAC-2013-NakamuraNTO #towards
- Towards solving an obstacle problem by the cooperation of UAVs and UGVs (SN, HN, YT, AO), pp. 77–82.
- SAC-2013-PerkusichAP #detection #development
- A model to detect problems on scrum-based software development projects (MP, HOdA, AP), pp. 1037–1042.
- SAC-2013-RabanalR #metaheuristic #polynomial #reduction #using
- Using polynomial reductions to test the suitability of metaheuristics for solving NP-complete problems (PR, IR), pp. 194–199.
- SAC-2013-ToledoAOD #algorithm #hybrid #multi #search-based
- A hybrid compact genetic algorithm applied to the multi-level capacitated lot sizing problem (CFMT, MdSA, RRRdO, ACBD), pp. 200–205.
- CASE-2013-LiF #approach #integer #linear #multi #programming #scheduling
- A mixed integer linear programming approach for multi-degree cyclic multi-hoist scheduling problems without overlapping (XL, RYKF), pp. 274–279.
- CASE-2013-Pan #combinator #scheduling
- A combinatorial auctions perspective on min-sum scheduling problems (YP), pp. 564–569.
- CASE-2013-WangSS #novel #order #polynomial #scheduling
- A novel quadratic formulation for customer order scheduling problem (LW, ZS, LS), pp. 576–580.
- DAC-2013-KimJK #algorithm
- An optimal algorithm of adjustable delay buffer insertion for solving clock skew variation problem (JK, DJ, TK), p. 6.
- DATE-2013-KahngLN #design #estimation #metamodelling
- Enhanced metamodeling techniques for high-dimensional IC design estimation problems (ABK, BL, SN), pp. 1861–1866.
- DATE-2013-LoiaconoPPPQRVB #estimation #multi #performance
- Fast cone-of-influence computation and estimation in problems with multiple properties (CL, MP, PP, DP, SQ, SR, DV, JB), pp. 803–806.
- DATE-2013-PaternaR #using
- Mitigating dark-silicon problems using superlattice-based thermoelectric coolers (FP, SR), pp. 1391–1394.
- PDP-2013-BukataS #algorithm #design #gpu #scheduling
- A GPU Algorithm Design for Resource Constrained Project Scheduling Problem (LB, PS), pp. 367–374.
- PDP-2013-TemboNB #adaptation #clustering #distributed #protocol #self #simulation
- Distributed Iterative Solution of Numerical Simulation Problems on Infiniband and Ethernet Clusters via the P2PSAP Self-Adaptive Protocol (SRT, TTN, DEB), pp. 121–125.
- PPoPP-2013-GrassoKCF #automation #clustering #parallel
- Automatic problem size sensitive task partitioning on heterogeneous parallel systems (IG, KK, BC, TF), pp. 281–282.
- FoSSaCS-2013-KarandikarS #complexity #parametricity #recursion
- The Parametric Ordinal-Recursive Complexity of Post Embedding Problems (PK, SS), pp. 273–288.
- STOC-2013-BuchbinderNS #clustering #exponential #multi
- Simplex partitioning via exponential clocks and the multiway cut problem (NB, JN, RS), pp. 535–544.
- STOC-2013-ChonevOW
- The orbit problem in higher dimensions (VC, JO, JW), pp. 941–950.
- STOC-2013-Har-PeledR #algorithm #distance #linear
- Net and prune: a linear time algorithm for euclidean distance problems (SHP, BAR), pp. 605–614.
- STOC-2013-Miller #graph #optimisation #scalability #using
- Solving large optimization problems using spectral graph theory (GLM), p. 981.
- CADE-2013-WilliamsK #proving #reduction #satisfiability
- Propositional Temporal Proving with Reductions to a SAT Problem (RW, BK), pp. 421–435.
- CSL-2013-BilkowskiS #ambiguity #infinity
- Unambiguity and uniformization problems on infinite trees (MB, MS), pp. 81–100.
- ICST-2013-PastoreMF #named #question
- CrowdOracles: Can the Crowd Solve the Oracle Problem? (FP, LM, GF), pp. 342–351.
- LICS-2013-Comon-Lundh #logic #modelling #named #security
- LICS: Logic in Computer Security — Some Attacker’s Models and Related Decision Problems (HCL), p. 1.
- LICS-2013-FacchiniMS #automaton
- Rabin-Mostowski Index Problem: A Step beyond Deterministic Automata (AF, FM, MS), pp. 499–508.
- LICS-2013-LerouxPS #on the
- On the Context-Freeness Problem for Vector Addition Systems (JL, VP, GS), pp. 43–52.
- SAT-2013-Atserias #algebra #bound #proving
- The Proof-Search Problem between Bounded-Width Resolution and Bounded-Degree Semi-algebraic Proofs (AA), pp. 1–17.
- SAT-2013-Stuckey
- There Are No CNF Problems (PJS), pp. 19–21.
- JCDL-2012-FreireBC #analysis #library #metadata #recognition
- An analysis of the named entity recognition problem in digital library metadata (NF, JLB, PC), pp. 171–174.
- PODS-2012-DengFG #complexity #on the #recommendation
- On the complexity of package recommendation problems (TD, WF, FG), pp. 261–272.
- VLDB-2012-ErdosILTB #multi
- The Filter-Placement Problem and its Application to Minimizing Information Multiplicity (DE, VI, AL, ET, AB), pp. 418–429.
- VLDB-2013-LiDLMS12 #question #web
- Truth Finding on the Deep Web: Is the Problem Solved? (XL, XLD, KL, WM, DS), pp. 97–108.
- ITiCSE-2012-Bunimovich #education
- Teachers’ perception of teaching problem-solving strategies to novices (LB), p. 393.
- ITiCSE-2012-JarusekP
- A web-based problem solving tool for introductory computer science (PJ, RP), p. 371.
- ITiCSE-2012-MorgadoB
- Problem presentation in CS1 courses (CM, FB), p. 396.
- ITiCSE-2012-MorgadoB12a #approach
- A structured approach to problem solving in CS1 (CM, FB), p. 399.
- ITiCSE-2012-Sudol-DeLyserSC #comprehension #learning
- Code comprehension problems as learning events (LASD, MS, SC), pp. 81–86.
- SIGITE-2012-Kawash #learning #student
- Engaging students by intertwining puzzle-based and problem-based learning (JK), pp. 227–232.
- SIGITE-2012-LHeureuxBCS #implementation
- IT problem solving: an implementation of computational thinking in information technology (JL, DB, RFC, KS), pp. 183–188.
- DLT-2012-0002HOT #context-free grammar #word
- Semigroups with a Context-Free Word Problem (MH, DFH, MDO, RMT), pp. 97–108.
- ICALP-v1-2012-BarmanUCM
- Secretary Problems with Convex Costs (SB, SU, SC, DLM), pp. 75–87.
- ICALP-v1-2012-CharikarL #approach
- A Dependent LP-Rounding Approach for the k-Median Problem (MC, SL), pp. 194–205.
- ICALP-v1-2012-DeDS
- The Inverse Shapley Value Problem (AD, ID, RAS), pp. 266–277.
- ICALP-v1-2012-GharibianK #approximate #quantum
- Hardness of Approximation for Quantum Problems (SG, JK), pp. 387–398.
- ICALP-v1-2012-GuptaL #metric #online
- The Online Metric Matching Problem for Doubling Metrics (AG, KL), pp. 424–435.
- ICALP-v1-2012-HughesPRS
- A Thirty Year Old Conjecture about Promise Problems (AH, AP, NR, ALS), pp. 473–484.
- ICALP-v1-2012-LaekhanukitGS #approach
- A Rounding by Sampling Approach to the Minimum Size k-Arc Connected Subgraph Problem (BL, SOG, MS), pp. 606–616.
- ICALP-v2-2012-Barenboim #locality #on the
- On the Locality of Some NP-Complete Problems (LB), pp. 403–415.
- ICALP-v2-2012-BhawalkarKLRS #network #social
- Preventing Unraveling in Social Networks: The Anchored k-Core Problem (KB, JMK, KL, TR, AS), pp. 440–451.
- ICALP-v2-2012-Torunczyk #word
- Languages of Profinite Words and the Limitedness Problem (ST), pp. 377–389.
- LATA-2012-AbdullaAS #automaton #low cost #reachability
- The Minimal Cost Reachability Problem in Priced Timed Pushdown Systems (PAA, MFA, JS), pp. 58–69.
- LATA-2012-Hovland #constraints #regular expression
- The Membership Problem for Regular Expressions with Unordered Concatenation and Numerical Constraints (DH), pp. 313–324.
- FM-2012-AndreFKS #robust #scheduling
- IMITATOR 2.5: A Tool for Analyzing Robustness in Scheduling Problems (ÉA, LF, UK, RS), pp. 33–36.
- FM-2012-DIppolitoBPU
- The Modal Transition System Control Problem (ND, VAB, NP, SU), pp. 155–170.
- RTA-2012-Al-HassaniMCS #term rewriting
- A Term Rewriting System for Kuratowski’s Closure-Complement Problem (OAH, QaM, CSC, VS), pp. 38–52.
- FLOPS-2012-Morihata #algorithm #parallel
- Calculational Developments of New Parallel Algorithms for Size-Constrained Maximum-Sum Segment Problems (AM), pp. 213–227.
- CIG-2012-PowleyWC #heuristic #monte carlo #physics
- Monte Carlo Tree Search with macro-actions and heuristic route planning for the Physical Travelling Salesman Problem (EJP, DW, PIC), pp. 234–241.
- CHI-2012-BoujarwahAA #social
- Socially computed scripts to support social problem solving skills (FAB, GDA, RIA), pp. 1987–1996.
- CHI-2012-HartswoodPTBARS #reuse
- Problems of data mobility and reuse in the provision of computer-based training for screening mammography (MH, RP, PT, LB, SA, MR, RS), pp. 909–918.
- CHI-2012-PetrieP #comparison #interactive #usability #what
- What do users really care about?: a comparison of usability problems found by users and experts on highly interactive websites (HP, CP), pp. 2107–2116.
- CHI-2012-PowerFPS #guidelines #web
- Guidelines are only half of the story: accessibility problems encountered by blind users on the web (CP, APF, HP, DS), pp. 433–442.
- CSCW-2012-HuhA #collaboration
- Collaborative help in chronic disease management: supporting individualized problems (JH, MSA), pp. 853–862.
- CSCW-2012-ZhouZAH #documentation #health
- Cooperative documentation: the patient problem list as a nexus in electronic health records (XZ, KZ, MSA, DAH), pp. 911–920.
- ICEIS-J-2012-BonacinHRPB12a #aspect-oriented #collaboration #concept #framework #towards
- Pragmatic Aspects of Collaborative Problem Solving: Towards a Framework for Conceptualizing Dynamic Knowledge (RB, HHH, JCdR, RP, MCCB), pp. 410–426.
- ICEIS-v3-2012-BonacinHRPB #analysis #aspect-oriented #challenge #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.
- CIKM-2012-NiuLGC #probability #ranking
- A new probabilistic model for top-k ranking problem (SN, YL, JG, XC), pp. 2519–2522.
- ICML-2012-BootsG #identification
- Two Manifold Problems with Applications to Nonlinear System Identification (BB, GJG), p. 8.
- ICML-2012-CharlinZB #learning
- Active Learning for Matching Problems (LC, RSZ, CB), p. 23.
- ICML-2012-PachauriCS #analysis
- Incorporating Domain Knowledge in Matching Problems via Harmonic Analysis (DP, MDC, VS), p. 112.
- ICML-2012-ScherrerHTH #algorithm #coordination #scalability
- Scaling Up Coordinate Descent Algorithms for Large ℓ1 Regularization Problems (CS, MH, AT, DH), p. 50.
- ICML-2012-SunRZ #adaptation #multi #named
- AOSO-LogitBoost: Adaptive One-Vs-One LogitBoost for Multi-Class Problem (PS, MDR, JZ), p. 103.
- ICML-2012-XiaoZ
- A Proximal-Gradient Homotopy Method for the L1-Regularized Least-Squares Problem (LX, TZ), p. 160.
- ICPR-2012-CermanH #learning
- Tracking with context as a semi-supervised learning and labeling problem (LC, VH), pp. 2124–2127.
- ICPR-2012-GimelfarbGND #concurrent #optimisation
- Concurrent propagation for solving ill-posed problems of global discrete optimisation (GLG, RG, RN, PD), pp. 1864–1867.
- ICPR-2012-GkamasCN #probability
- A probabilistic formulation of the optical flow problem (TG, GKC, CN), pp. 754–757.
- ICPR-2012-LiuCSTN #learning #multi #performance #recursion #scalability
- Recursive NMF: Efficient label tree learning for large multi-class problems (LL, PMC, SS, PNT, AN), pp. 2148–2151.
- ICPR-2012-TurkovKM #concept #pattern matching #pattern recognition #recognition
- The Bayesian logistic regression in pattern recognition problems under concept drift (PAT, OK, VM), pp. 2976–2979.
- KDD-2012-Li
- Nine real hard problems we’d like you to solve (RL), p. 1.
- KDD-2012-MajumderDN #network #social
- Capacitated team formation problem on social networks (AM, SD, KVMN), pp. 1005–1013.
- KDIR-2012-LemnaruTCP #case study #classification #detection #hybrid #network
- A Hybrid Solution for Imbalanced Classification Problems — Case Study on Network Intrusion Detection (CL, ATV, AC, RP), pp. 348–352.
- KDIR-2012-MountassirBB #analysis #semistructured data #sentiment #set
- Addressing the Problem of Unbalanced Data Sets in Sentiment Analysis (AM, HB, IB), pp. 306–311.
- KEOD-2012-ArtesCM #modelling
- Modeling Genealogical Domain — An Open Problem (JCA, JCC, EM), pp. 202–207.
- KMIS-2012-AkiyoshiSK #learning #towards
- A Project Manager Skill-up Simulator Towards Problem Solving-based Learning (MA, MS, NK), pp. 190–195.
- KR-2012-FaberTW #equivalence #optimisation
- Strong Equivalence of Qualitative Optimization Problems (WF, MT, SW).
- MLDM-2012-ChanguelL #independence #machine learning #metadata
- Content Independent Metadata Production as a Machine Learning Problem (SC, NL), pp. 306–320.
- MLDM-2012-TurkovKM #approach #concept #pattern matching #pattern recognition #recognition
- Bayesian Approach to the Concept Drift in the Pattern Recognition Problems (PAT, OK, VM), pp. 1–10.
- SIGIR-2012-LipkaSA #classification #clustering #information retrieval
- Cluster-based one-class ensemble for classification problems in information retrieval (NL, BS, MA), pp. 1041–1042.
- SIGIR-2012-Whiting #ranking
- The essence of time: considering temporal relevance as an intent-aware ranking problem (SW), p. 1000.
- ECMFA-2012-BurtonPRKPS #modelling #using
- Solving Acquisition Problems Using Model-Driven Engineering (FRB, RFP, LMR, DSK, SMP, SS), pp. 428–443.
- PLEASE-2012-LeitnerWK #multi #optimisation
- Optimizing problem space representations through domain multi-modeling (AL, RW, CK), pp. 49–52.
- OOPSLA-2012-KulkarniC #compilation #machine learning #optimisation #using
- Mitigating the compiler optimization phase-ordering problem using machine learning (SK, JC), pp. 147–162.
- OOPSLA-2012-LucasER #detection #distributed #sequence
- Detecting problematic message sequences and frequencies in distributed systems (CL, SGE, DSR), pp. 915–926.
- PADL-2012-LierlerSTW #declarative
- Weighted-Sequence Problem: ASP vs CASP and Declarative vs Problem-Oriented Solving (YL, SS, MT, AW), pp. 63–77.
- PLDI-2012-BenzHH #float #program analysis
- A dynamic program analysis to find floating-point accuracy problems (FB, AH, SH), pp. 453–462.
- REFSQ-2012-GulkeRJA #complexity #development #requirements
- High-Level Requirements Management and Complexity Costs in Automotive Development Projects: A Problem Statement (TG, BR, MJ, JA), pp. 94–100.
- FSE-2012-WalkerRS #composition #question
- Do crosscutting concerns cause modularity problems? (RJW, SR, JS), p. 49.
- ICSE-2012-GrechanikFX #automation #learning #performance #testing
- Automatically finding performance problems with feedback-directed learning software testing (MG, CF, QX), pp. 156–166.
- ICSE-2012-RoehmM #automation #detection #developer #development #process
- Automatically detecting developer activities and problems in software development work (TR, WM), pp. 1261–1264.
- ICSE-2012-YanXR #java #performance #profiling
- Uncovering performance problems in Java applications with reference propagation profiling (DY, G(X, AR), pp. 134–144.
- ICSE-2012-ZhengZ #detection #static analysis
- Static detection of resource contention problems in server-side scripts (YZ, XZ), pp. 584–594.
- SAC-2012-AlebrahimCHCH #architecture #design #interactive #model transformation
- Designing architectures from problem descriptions by interactive model transformation (AA, IC, MH, CC, DH), pp. 1256–1258.
- SAC-2012-BenreguiaK #consistency #graph #morphism
- A consistency rule for graph isomorphism problem (BB, HK), pp. 906–911.
- SAC-2012-KosinaG #multi #performance
- Very Fast Decision Rules for multi-class problems (PK, JG), pp. 795–800.
- SAC-2012-ManciniFP #combinator #constraints #database #relational #synthesis
- Combinatorial problem solving over relational databases: view synthesis through constraint-based local search (TM, PF, JP), pp. 80–87.
- SAC-2012-SalehSRDBB #design #distributed
- Mechanism design for decentralized vehicle routing problem (MS, AS, SR, MD, JB, AB), pp. 749–754.
- CASE-2012-BilykM #heuristic #parallel #search-based
- Variable neighborhood search-based subproblem solution procedures for a parallel shifting bottleneck heuristic for complex job shops (AB, LM), pp. 419–424.
- CASE-2012-CaiL #algorithm #hybrid #multi #scheduling #search-based
- A hybrid genetic algorithm for resource-constrained multi-project scheduling problem with resource transfer time (ZC, XL), pp. 569–574.
- CASE-2012-GhonaimGS #on the
- On the assignment problem of arbitrary processing time operations in partially overlapping manufacturing resources (WG, HG, WS), pp. 341–346.
- CASE-2012-NilakantanP #assembly #performance
- An efficient PSO for type II robotic assembly line balancing problem (JMN, SGP), pp. 600–605.
- CASE-2012-Rodriguez-VerjanAGXB
- Healthcare at home facility location-allocation problem (CRV, VA, TG, XX, VB), pp. 150–155.
- CASE-2012-SugiyamaNITU #approach #composition
- A bilevel decomposition approach to railway crew rostering problems for fair labor condition (TS, TN, MI, ST, KU), pp. 383–389.
- CASE-2012-WikborgL #multi #petri net #scheduling
- Scheduling of Petri nets as a multi-objective shortest path problem (UW, TEL), pp. 212–217.
- CASE-2012-YalcindagMS #health
- Operator assignment and routing problems in home health care services (SY, AM, ES), pp. 329–334.
- DAC-2012-JoubertDBTH #3d #exclamation
- Capacitance of TSVs in 3-D stacked chips a problem?: not for neuromorphic systems! (AJ, MD, BB, OT, RH), pp. 1264–1265.
- DAC-2012-KirschP
- Incorrect systems: it’s not the problem, it’s the solution (CMK, HP), pp. 913–917.
- DATE-2012-KirschPSCHHLLRSTV #cyber-physical #in the cloud #migration
- Cyber-physical cloud computing: The binding and migration problem (CMK, EP, RS, HC, RH, JH, FL, ML, AR, RS, RT, DV), pp. 1425–1428.
- DATE-2012-LiuMG #estimation #performance
- A fast analog circuit yield estimation method for medium and high dimensional problems (BL, JM, GGEG), pp. 751–756.
- DATE-2012-SuriBE #approach #multi #scalability
- A scalable GPU-based approach to accelerate the multiple-choice knapsack problem (BS, UDB, PE), pp. 1126–1129.
- PDP-2012-DavidovicQ #reduction #scalability #symmetry
- Applying OOC Techniques in the Reduction to Condensed Form for Very Large Symmetric Eigenproblems on GPUs (DD, ESQO), pp. 442–449.
- PDP-2012-SaenkoK #algorithm #design #evaluation #mining #performance #search-based
- Design and Performance Evaluation of Improved Genetic Algorithm for Role Mining Problem (IS, IVK), pp. 269–274.
- PDP-2012-SeguraSL #adaptation #benchmark #metric #parallel
- Analysing the Adaptation Level of Parallel Hyperheuristics Applied to Multiobjectivised Benchmark Problems (CS, ES, CL), pp. 138–145.
- PDP-2012-SteinbrecherS #on the #optimisation #sequence
- On Optimizing the Longest Common Subsequence Problem by Loop Unrolling Along Wavefronts (JS, WS), pp. 603–611.
- FoSSaCS-2012-KieferMOWW #automaton #complexity #equivalence #on the #probability
- On the Complexity of the Equivalence Problem for Probabilistic Automata (SK, ASM, JO, BW, JW), pp. 467–481.
- STOC-2012-BartalGK #approximate #polynomial
- The traveling salesman problem: low-dimensionality implies a polynomial time approximation scheme (YB, LAG, RK), pp. 663–672.
- STOC-2012-BartoK #constraints #robust #satisfiability
- Robust satisfiability of constraint satisfaction problems (LB, MK), pp. 931–940.
- STOC-2012-BulanekKS #bound #online
- Tight lower bounds for the online labeling problem (JB, MK, MES), pp. 1185–1198.
- STOC-2012-ChakrabartiFW #multi #network
- When the cut condition is enough: a complete characterization for multiflow problems in series-parallel networks (AC, LF, CW), pp. 19–26.
- STOC-2012-DeDFS #approximate #parametricity
- Nearly optimal solutions for the chow parameters problem and low-weight approximation of halfspaces (AD, ID, VF, RAS), pp. 729–746.
- STOC-2012-KhotPV #preprocessor
- 2log1-ε n hardness for the closest vector problem with preprocessing (SK, PP, NKV), pp. 277–288.
- STOC-2012-MakarychevMV #algorithm #approximate #clustering
- Approximation algorithms for semi-random partitioning problems (KM, YM, AV), pp. 367–384.
- STOC-2012-Vegh #algorithm #low cost #polynomial
- Strongly polynomial algorithm for a class of minimum-cost flow problems with separable convex objectives (LAV), pp. 27–40.
- CSL-2012-BodirskyW #constraints #equivalence
- Equivalence Constraint Satisfaction Problems (MB, MW), pp. 122–136.
- ICLP-2012-BlockeelBBCP #data mining #machine learning #mining #modelling
- Modeling Machine Learning and Data Mining Problems with FO(·) (HB, BB, MB, BdC, SDP, MD, AL, JR, SV), pp. 14–25.
- ICLP-J-2012-BliemMW #declarative #named #programming #using
- D-FLAT: Declarative problem solving using tree decompositions and answer-set programming (BB, MM, SW), pp. 445–464.
- ICST-2012-RunesonE #3d #product line #testing
- Software Product Line Testing — A 3D Regression Testing Problem (PR, EE), pp. 742–746.
- ICTSS-2012-LahamiKBJ #adaptation #architecture #design #distributed #using
- Using Knapsack Problem Model to Design a Resource Aware Test Architecture for Adaptable and Distributed Systems (ML, MK, MB, MJ), pp. 103–118.
- IJCAR-2012-RathsO #first-order #library #logic
- The QMLTP Problem Library for First-Order Modal Logics (TR, JO), pp. 454–461.
- IJCAR-2012-RauSS #correctness #program transformation #termination
- Correctness of Program Transformations as a Termination Problem (CR, DS, MSS), pp. 462–476.
- LICS-2012-BarceloFL #graph #logic
- Graph Logics with Rational Relations and the Generalized Intersection Problem (PB, DF, LL), pp. 115–124.
- LICS-2012-ChatterjeeT #automaton #decidability #infinity #probability #word
- Decidable Problems for Probabilistic Automata on Infinite Words (KC, MT), pp. 185–194.
- LICS-2012-CreusGGR
- The HOM Problem is EXPTIME-Complete (CC, AG, GG, LR), pp. 255–264.
- LICS-2012-FijalkowGO #automaton #probability
- Deciding the Value 1 Problem for Probabilistic Leaktight Automata (NF, HG, YO), pp. 295–304.
- SAT-2012-CreignouV #complexity #satisfiability
- Parameterized Complexity of Weighted Satisfiability Problems (NC, HV), pp. 341–354.
- SAT-2012-GaneshOSDRS #named #satisfiability
- Lynx: A Programmatic SAT Solver for the RNA-Folding Problem (VG, CWO, MS, SD, MCR, ASL), pp. 143–156.
- SMT-2012-AzizWD #estimation #machine learning #smt
- A Machine Learning Technique for Hardness Estimation of QFBV SMT Problems (MAA, AGW, NMD), pp. 57–66.
- WICSA-2011-GalsterA #architecture #variability
- Handling Variability in Software Architecture: Problems and Implications (MG, PA), pp. 171–180.
- ICDAR-2011-LoprestiN #question
- When is a Problem Solved? (DPL, GN), pp. 32–36.
- PODS-2011-JowhariST #bound
- Tight bounds for Lp samplers, finding duplicates in streams, and related problems (HJ, MS, GT), pp. 49–58.
- PODS-2011-ShengT
- FIFO indexes for decomposable problems (CS, YT), pp. 25–35.
- CSEET-2011-IyerMJ #incremental
- Incremental sequential problem based training model — Institute corporate readiness (SI, SM, AMJ), pp. 507–511.
- CSEET-2011-RichardsonRSPD #learning #quality #research
- Educating software engineers of the future: Software quality research through problem-based learning (IR, LR, SBS, BP, YD), pp. 91–100.
- CSEET-2011-Sweedyk #education #how
- How middle school teachers solved our SE project problems (ES), pp. 449–453.
- ITiCSE-2011-LevyV #education
- A problem solving teaching guide based on a procedure intertwined with a teaching model (RBBL, JÁVI), p. 374.
- ITiCSE-2011-MesserK #process #using
- The use of mediating artifacts in embedding problem solving processes in an e-learning environment (OMM, AK), p. 390.
- ITiCSE-2011-OliveiraMR #learning #programming
- From concrete to abstract?: problem domain in the learning of introductory programming (OLO, AMM, NTR), pp. 173–177.
- ICPC-2011-Wu #api #evolution #framework #modelling #multi #optimisation
- Modeling Framework API Evolution as a Multi-objective Optimization Problem (WW), pp. 262–265.
- MSR-2011-Zhou #debugging #detection
- Connecting technology with real-world problems — from copy-paste detection to detecting known bugs: (YZ), p. 2.
- WCRE-2011-CodobanMM #design #fault #named
- iProblems — An Integrated Instrument for Reporting Design Flaws, Vulnerabilities and Defects (MC, CM, RM), pp. 437–438.
- DLT-J-2009-BertoniCR11 #context-free grammar
- The Inclusion Problem of Context-Free Languages: Some Tractable Cases (AB, CC, RR), pp. 289–299.
- DLT-J-2009-HalavaH11 #reduction
- Reduction Tree of the Binary Generalized Post Correspondence Problem (VH, SH), pp. 473–490.
- CIAA-J-2010-BujtasDINT11
- The Graph-Bin Packing Problem (CB, GD, CI, JNG, ZT), pp. 1971–1993.
- AFL-2011-Blanchet-Sadri #word
- Open Problems on Avoidable Patterns in Partial Words (FBS), pp. 12–24.
- AFL-2011-BorgwardtP #automaton #infinity
- The Inclusion Problem for Weighted Automata on Infinite Trees (SB, RP), pp. 108–122.
- CIAA-2011-Ibarra #equivalence #linear #on the #transducer
- On the Containment and Equivalence Problems for GSMs, Transducers, and Linear CFGs (OHI), pp. 190–202.
- CIAA-2011-Martyugin #automaton #complexity #word
- Complexity of Problems Concerning Reset Words for Cyclic and Eulerian Automata (PM), pp. 238–249.
- DLT-2011-DiekertM #infinity #word
- Solving Word Problems in Group Extensions over Infinite Words (VD, AGM), pp. 192–203.
- DLT-2011-RodaroS #automaton
- Never Minimal Automata and the Rainbow Bipartite Subgraph Problem (ER, PVS), pp. 374–385.
- ICALP-v1-2011-AustrinK #distance #reduction
- A Simple Deterministic Reduction for the Gap Minimum Distance of Code Problem (PA, SK), pp. 474–485.
- ICALP-v1-2011-BermanBMRY #approximate
- Improved Approximation for the Directed Spanner Problem (PB, AB, KM, SR, GY), pp. 1–12.
- ICALP-v1-2011-BockenhauerKKK #complexity #on the
- On the Advice Complexity of the k-Server Problem (HJB, DK, RK, RK), pp. 207–218.
- ICALP-v1-2011-ChekuriE
- Submodular Cost Allocation Problem and Applications (CC, AE), pp. 354–366.
- ICALP-v1-2011-DingX #clustering
- Solving the Chromatic Cone Clustering Problem via Minimum Spanning Sphere (HD, JX), pp. 773–784.
- ICALP-v1-2011-GuoLV #complexity #symmetry
- The Complexity of Symmetric Boolean Parity Holant Problems — (HG, PL, LGV), pp. 712–723.
- ICALP-v1-2011-HuangK
- Popular Matchings in the Stable Marriage Problem (CCH, TK), pp. 666–677.
- ICALP-v1-2011-Mengel #constraints
- Characterizing Arithmetic Circuit Classes by Constraint Satisfaction Problems — (SM), pp. 700–711.
- ICALP-v1-2011-QianW #algorithm #online
- An O(logn)-Competitive Algorithm for Online Constrained Forest Problems (JQ, DPW), pp. 37–48.
- ICALP-v1-2011-Varadaraja #approximate
- Buyback Problem — Approximate Matroid Intersection with Cancellation Costs (ABV), pp. 379–390.
- ICALP-v2-2011-AhnG #linear #programming
- Linear Programming in the Semi-streaming Model with Application to the Maximum Matching Problem (KJA, SG), pp. 526–538.
- ICALP-v2-2011-BertrandBBS #automaton
- Emptiness and Universality Problems in Timed Automata with Positive Frequency (NB, PB, TB, AS), pp. 246–257.
- ICALP-v2-2011-Li #algorithm #approximate
- A 1.488 Approximation Algorithm for the Uncapacitated Facility Location Problem (SL), pp. 77–88.
- LATA-2011-BareckaC #automaton #complexity #finite
- The Parameterized Complexity of Chosen Problems for Finite Automata on Trees (AB, WC), pp. 129–141.
- LATA-2011-DelahayeLLPW #markov
- Decision Problems for Interval Markov Chains (BD, KGL, AL, MLP, AW), pp. 274–285.
- LATA-2011-Leroux #proving #reachability #self
- Vector Addition System Reachability Problem: A Short Self-contained Proof (JL), pp. 41–64.
- LATA-2011-Quaas #automaton #bound #on the
- On the Interval-Bound Problem for Weighted Timed Automata (KQ), pp. 452–464.
- RTA-2011-StumpKO #confluence
- Type Preservation as a Confluence Problem (AS, GK, REHO), pp. 345–360.
- DiGRA-2011-RengS #design #game studies #student
- Problem Based Game Design - Engaging Students by Innovation (LR, HSF).
- FDG-2011-Breuer #game studies
- (In)formative play: the effects of digital games on creativity and problem-solving skills (JB), pp. 241–243.
- VS-Games-2011-VosinakisKZ #case study #learning
- An Exploratory Study of Problem-Based Learning in Virtual Worlds (SV, PK, PZ), pp. 112–119.
- GCM-2010-PicardM11 #embedded #graph #induction #representation
- Coinductive Graph Representation: the Problem of Embedded Lists (CP, RM).
- CHI-2011-HuangWD #using
- No clicks, no problem: using cursor movements to understand and improve search (JH, RWW, STD), pp. 1225–1234.
- CHI-2011-KandoganKMP #how #interface
- How a freeform spatial interface supports simple problem solving tasks (EK, JK, TPM, PP), pp. 925–934.
- CHI-2011-TashmanE
- Active reading and its discontents: the situations, problems and ideas of readers (CST, WKE), pp. 2927–2936.
- CSCW-2011-NewmanLMRM #challenge #facebook #health #network #online #social #using
- It’s not that I don’t have problems, I’m just not putting them on facebook: challenges and opportunities in using online social networks for health (MWN, DL, SAM, PR, MEM), pp. 341–350.
- DUXU-v1-2011-ChenT #design #industrial #learning #student
- Exploring the Learning Problems and Resources Usage of Undergraduate Industrial Design Students in Design Studio (WC, HHT), pp. 43–52.
- HCD-2011-YajimaSY #comprehension #visualisation
- Understanding the Business Realities: An Interview Technique Which Can Visualize the Job Problems (AY, YS, TY), pp. 449–457.
- HCI-UA-2011-BonariniCGMRT #game studies
- Affective Videogames: The Problem of Wearability and Comfort (AB, FC, MG, MM, MR, ST), pp. 649–658.
- HCI-UA-2011-KimLK #interactive #usability
- Inherent Usability Problems in Interactive Voice Response Systems (HCK, DL, HK), pp. 476–483.
- HIMI-v2-2011-YuCW #communication #framework #interactive #named #platform #product line
- SAM: A Spatial Interactive Platform for Studying Family Communication Problem (GJY, TWC, YCW), pp. 207–216.
- CAiSE-2011-QureshiJP #adaptation #ontology #requirements #self
- Requirements Engineering for Self-Adaptive Systems: Core Ontology and Problem Statement (NAQ, IJ, AP), pp. 33–47.
- ICEIS-J-2011-LemnaruP #classification
- Imbalanced Classification Problems: Systematic Study, Issues and Best Practices (CL, RP), pp. 35–50.
- ICEIS-v2-2011-BadarudinSSMM #algorithm #memory management #representation #search-based
- An Improved Genetic Algorithm with Gene Value Representation and Short Term Memory for Shape Assignment Problem (IB, ABMS, MNS, AM, MTMM), pp. 178–183.
- ICEIS-v2-2011-Ng #framework
- Problem Solving Framework within Decision Support Systems (YHN), pp. 140–146.
- ICEIS-v2-2011-Santibanez-GonzalezLM #algorithm #design #search-based
- A Genetic Algorithm for Solving a Public Sector Sustainable Supply Chain Design Problem (EDRSG, HPLL, GRM), pp. 222–227.
- ICEIS-v4-2011-YangJZH #multi
- Vehicle Routing Problem with Multi-depot and Multi-task (HY, LJ, YZ, MH), pp. 650–655.
- CIKM-2011-AnderkaSL #classification #detection #quality
- Detection of text quality flaws as a one-class classification problem (MA, BS, NL), pp. 2313–2316.
- CIKM-2011-PCK #repository #trade-off
- More or better: on trade-offs in compacting textual problem solution repositories (DP, SC, DK), pp. 2321–2324.
- CIKM-2011-XingZZ #bias #feedback #on the
- On bias problem in relevance feedback (QX, YZ, LZ), pp. 1965–1968.
- ICML-2011-HannahD #approximate #programming
- Approximate Dynamic Programming for Storage Problems (LH, DBD), pp. 337–344.
- ICML-2011-Potetz #linear #using
- Estimating the Bayes Point Using Linear Knapsack Problems (BP), pp. 257–264.
- ICML-2011-WaughZB #equilibrium
- Computational Rationalization: The Inverse Equilibrium Problem (KW, BDZ, DB), pp. 1169–1176.
- KDD-2011-BrucknerS #game studies #predict
- Stackelberg games for adversarial prediction problems (MB, TS), pp. 547–555.
- KEOD-2011-SharmaB #ontology #question
- Can Ontologies Be Sufficient Solution to Requirement Engineering Problem? (RS, KKB), pp. 461–465.
- RecSys-2011-AnandG #approach
- A market-based approach to address the new item problem (SSA, NG), pp. 205–212.
- SEKE-2011-Zhang #heuristic
- Inconsistency-Induced Heuristics for Problem Solving (DZ), pp. 137–142.
- SEKE-2011-ZirkelW #correlation
- Proactive Problem Management and Event Correlation (WZ, GW), pp. 572–577.
- ECMFA-2011-ColomboKL #analysis #design #generative #modelling #requirements #using
- Generating Early Design Models from Requirements Analysis Artifacts Using Problem Frames and SysML (PC, FK, LL), pp. 97–114.
- ECMFA-2011-DouxABCFL #approach #eclipse #framework #platform
- An MDE-Based Approach for Solving Configuration Problems: An Application to the Eclipse Platform (GD, PA, GB, JC, MDDF, SUJL), pp. 160–171.
- MoDELS-2011-LettnerTM #embedded #identification #migration #overview
- A Critical Review of Applied MDA for Embedded Devices: Identification of Problem Classes and Discussing Porting Efforts in Practice (ML, MT, RM), pp. 228–242.
- PLEASE-2011-MichalikWB #evolution #on the #product line
- On the problems with evolving Egemin’s software product line (BM, DW, WVB), pp. 15–19.
- SPLC-2011-DaoLK #approach #product line #quality
- Problem Frames-Based Approach to Achieving Quality Attributes in Software Product Line Engineering (TMD, HL, KCK), pp. 175–180.
- POPL-2011-Leroux #proving #reachability #self
- Vector addition system reachability problem: a short self-contained proof (JL), pp. 307–316.
- RE-2011-CoteHSH #analysis #named #requirements #uml
- UML4PF — A tool for problem-oriented requirements analysis (IC, MH, HS, DH), pp. 349–350.
- RE-2011-Regnell #evolution #mobile #scalability
- Large-scale feature evolution: Problems and solutions from the mobile domain (BR), p. 323.
- RE-2011-VeerappaL #clustering #comprehension #multi
- Understanding clusters of optimal solutions in multi-objective decision problems (VV, EL), pp. 89–98.
- ICSE-2011-Xiao #developer #generative #identification #testing #towards
- Problem identification for structural test generation: first step towards cooperative developer testing (XX), pp. 1179–1181.
- ICSE-2011-XiaoXTH #generative #identification #precise #testing
- Precise identification of problems for structural test generation (XX, TX, NT, JdH), pp. 611–620.
- ICSE-2011-XiaoXTH11a #identification #named #precise
- Covana: precise identification of problems in pex (XX, TX, NT, JdH), pp. 1004–1006.
- SAC-2011-ChhelGLLSHB
- The bacterial strains characterization problem (FC, AG, AL, FL, FS, GH, TB), pp. 108–109.
- SAC-2011-ClevenWW #analysis #design #performance #process
- Process performance management: illuminating design issues through a systematic problem analysis (AC, RW, FW), pp. 280–286.
- SAC-2011-FontesNPC #architecture #detection #learning
- An agent-based architecture for supporting the workgroups creation and the detection of out-of-context conversation on problem-based learning in virtual learning environments (LMdOF, FMMN, AÁAP, GALdC), pp. 1175–1180.
- SAC-2011-KatayamaKKM #algorithm #clique
- Memetic algorithm with strategic controller for the maximum clique problem (KK, AK, KK, HM), pp. 1062–1069.
- SAC-2011-KienHB #algorithm #communication #hybrid #search-based
- New hybrid genetic algorithm for solving optimal communication spanning tree problem (PTK, NDH, HTTB), pp. 1076–1081.
- SAC-2011-RosaGO #quality #satisfiability
- Optimal stopping methods for finding high quality solutions to satisfiability problems with preferences (EDR, EG, BO), pp. 901–906.
- SAC-2011-Zhang #analysis #constraints #geometry #graph
- Well-constrained completion for under-constrained geometric constraint problem based on connectivity analysis of graph (GFZ), pp. 1094–1099.
- CASE-2011-AmbrosinoBPSS #modelling
- Modeling and solving the train load planning problem in seaport container terminals (DA, AB, MP, SS, SS), pp. 208–213.
- CASE-2011-FantiSU #constraints #scheduling #symmetry #using
- Solving scheduling problems in distribution centers using symmetry breaking constraints (MPF, GS, WU), pp. 58–65.
- CASE-2011-NishiYI #approach #generative #scheduling
- Column generation approach to ship scheduling problems for international crude oil transportation (TN, SY, TI), pp. 468–473.
- CASE-2011-StumpM #multi #persistent
- Multi-robot persistent surveillance planning as a Vehicle Routing Problem (ES, NM), pp. 569–575.
- CASE-2011-Tanaka #approach #scheduling
- A unified approach for the scheduling problem with rejection (ST), pp. 369–374.
- CASE-2011-WuS #bound #multi
- A lower and upper bound guided nested partitions method for solving capacitated multi-level production planning problems (TW, LS), pp. 78–83.
- CGO-2011-LiuM #analysis #locality #using
- Pinpointing data locality problems using data-centric analysis (XL, JMMC), pp. 171–180.
- DATE-2011-PavlenkoWSKDSG #algebra #named #reasoning #smt #verification
- STABLE: A new QF-BV SMT solver for hard verification problems combining Boolean reasoning with computer algebra (EP, MW, DS, WK, AD, FS, GMG), pp. 155–160.
- PDP-2011-HifiSH #2d #distributed #peer-to-peer #performance
- High Performance Peer-to-Peer Distributed Computing with Application to Constrained Two-Dimensional Guillotine Cutting Problem (MH, TS, NH), pp. 552–559.
- PDP-2011-Kushida #implementation
- Element-wise Implementation of Iterative Solvers for FEM Problems on the Cell Processor (NK), pp. 401–408.
- PDP-2011-LiLTS #adaptation #algorithm #parallel
- Adaptive and Cost-Optimal Parallel Algorithm for the 0-1 Knapsack Problem (KL, LL, TT, EHMS), pp. 537–544.
- PDP-2011-SaenkoK #algorithm #mining #search-based
- Genetic Algorithms for Role Mining Problem (IS, IVK), pp. 646–650.
- FoSSaCS-2011-VelnerR #synthesis
- Church Synthesis Problem for Noisy Input (YV, AR), pp. 275–289.
- STOC-2011-BrandaoCY #algorithm #quantum
- A quasipolynomial-time algorithm for the quantum separability problem (FGSLB, MC, JY), pp. 343–352.
- STOC-2011-Chuzhoy #algorithm #graph
- An algorithm for the graph crossing number problem (JC), pp. 303–312.
- STOC-2011-KawarabayashiK #algorithm #approximate
- Breaking o(n1/2)-approximation algorithms for the edge-disjoint paths problem with congestion two (KiK, YK), pp. 81–88.
- TACAS-2011-TeigeF #probability #satisfiability
- Generalized Craig Interpolation for Stochastic Boolean Satisfiability Problems (TT, MF), pp. 158–172.
- CADE-2011-Brown #higher-order #proving #satisfiability #sequence #theorem proving
- Reducing Higher-Order Theorem Proving to a Sequence of SAT Problems (CEB), pp. 147–161.
- CADE-2011-DeharbeFMP #smt #symmetry
- Exploiting Symmetry in SMT Problems (DD, PF, SM, BWP), pp. 222–236.
- CSL-2011-DurandS #complexity #higher-order #logic #query
- Enumeration Complexity of Logical Query Problems with Second-order Variables (AD, YS), pp. 189–202.
- CSL-2011-Egri #constraints #on the
- On Constraint Satisfaction Problems below P (LE), pp. 203–217.
- CSL-2011-JenkinsORW #metric #synthesis
- The Church Synthesis Problem with Metric (MJ, JO, AR, JW), pp. 307–321.
- CSL-2011-LeCY #complexity #formal method
- A Formal Theory for the Complexity Class Associated with the Stable Marriage Problem (DTML, SAC, YY), pp. 381–395.
- LICS-2011-Barto #constraints #revisited
- The Dichotomy for Conservative Constraint Satisfaction Problems Revisited (LB), pp. 301–310.
- SAT-2011-Minato #diagrams #named #performance #permutation
- πDD: A New Decision Diagram for Efficient Problem Solving in Permutation Space (SiM), pp. 90–104.
- PODS-2010-KaneNW #algorithm
- An optimal algorithm for the distinct elements problem (DMK, JN, DPW), pp. 41–52.
- VLDB-2010-KopckeTR #evaluation
- Evaluation of entity resolution approaches on real-world match problems (HK, AT, ER), pp. 484–493.
- EDM-2010-StamperBC #knowledge base #using
- Using a Bayesian Knowledge Base for Hint Selection on Domain Specific Problems (JCS, TB, MJC), pp. 327–328.
- EDM-2010-XiongLS #locality #mining #performance
- Assessing Reviewer’s Performance Based on Mining Problem Localization in Peer-Review Data (WX, DJL, CDS), pp. 211–220.
- ITiCSE-2010-KiesmullerSBR #identification #online #pattern matching #pattern recognition #recognition #using
- Online identification of learner problem solving strategies using pattern recognition methods (UK, SS, TB, KR), pp. 274–278.
- CSMR-2010-CavalcantiACLM #debugging
- An Initial Study on the Bug Report Duplication Problem (YCC, ESdA, CEAdC, DL, SRdLM), pp. 264–267.
- ICPC-2010-BeronPOC
- SVS, BORS, SVSi: Three Strategies to Relate Problem and Program Domains (MMB, MJVP, NO, DCdC), pp. 60–61.
- AFL-J-2008-Lohrey10 #automaton #regular expression
- Compressed Membership Problems for Regular Expressions and Hierarchical Automata (ML), pp. 817–841.
- CIAA-2010-Rudie #summary
- A Summary of Some Discrete-Event System Control Problems (KR), pp. 4–16.
- DLT-2010-BremerF #bound
- Inclusion Problems for Patterns with a Bounded Number of Variables (JB, DDF), pp. 100–111.
- DLT-2010-CarpiD #hybrid #on the
- On the Hybrid Cerný-Road Coloring Problem and Hamiltonian Paths (AC, FD), pp. 124–135.
- DLT-2010-ChambartS #set
- Computing Blocker Sets for the Regular Post Embedding Problem (PC, PS), pp. 136–147.
- DLT-2010-HauboldLM #graph #morphism #word
- Compressed Conjugacy and the Word Problem for Outer Automorphism Groups of Graph Groups (NH, ML, CM), pp. 218–230.
- DLT-2010-Ibarra #on the
- On Decision Problems for Simple and Parameterized Machines (OHI), p. 31.
- ICALP-v1-2010-BansalBN
- Metrical Task Systems and the k-Server Problem on HSTs (NB, NB, JN), pp. 287–298.
- ICALP-v1-2010-BansalK #scheduling
- Inapproximability of Hypergraph Vertex Cover and Applications to Scheduling Problems (NB, SK), pp. 250–261.
- ICALP-v1-2010-BrietFV #constraints #rank
- The Positive Semidefinite Grothendieck Problem with Rank Constraint (JB, FMdOF, FV), pp. 31–42.
- ICALP-v1-2010-FakcharoenpholLN #algorithm #performance
- Faster Algorithms for Semi-matching Problems (JF, BL, DN), pp. 176–187.
- ICALP-v1-2010-GrandoniR #design #network
- Network Design via Core Detouring for Problems without a Core (FG, TR), pp. 490–502.
- ICALP-v1-2010-GuptaNR10a #adaptation #algorithm #approximate
- Approximation Algorithms for Optimal Decision Trees and Adaptive TSP Problems (AG, VN, RR), pp. 690–701.
- ICALP-v1-2010-KratschW #preprocessor
- Preprocessing of Min Ones Problems: A Dichotomy (SK, MW), pp. 653–665.
- ICALP-v1-2010-MakarychevMS #algorithm #approximate #polynomial #reduction
- Maximum Quadratic Assignment Problem: Reduction from Maximum Label Cover and LP-Based Approximation Algorithm (KM, RM, MS), pp. 594–604.
- ICALP-v2-2010-BlockiW #complexity #privacy
- Resolving the Complexity of Some Data Privacy Problems (JB, RW), pp. 393–404.
- ICALP-v2-2010-ChambartS
- Pumping and Counting on the Regular Post Embedding Problem (PC, PS), pp. 64–75.
- ICALP-v2-2010-GimbertO #automaton #decidability #finite #probability #word
- Probabilistic Automata on Finite Words: Decidable and Undecidable Problems (HG, YO), pp. 527–538.
- LATA-2010-AravantinosCP #complexity #satisfiability
- Complexity of the Satisfiability Problem for a Class of Propositional Schemata (VA, RC, NP), pp. 58–69.
- LATA-2010-BalanS #incremental
- Incremental Building in Peptide Computing to Solve Hamiltonian Path Problem (MSB, PS), pp. 549–560.
- LATA-2010-BousquetL #ambiguity #automaton #equivalence
- Equivalence and Inclusion Problem for Strongly Unambiguous Büchi Automata (NB, CL), pp. 118–129.
- LATA-2010-CarrascosaCGL #word
- Choosing Word Occurrences for the Smallest Grammar Problem (RC, FC, MG, GGIL), pp. 154–165.
- LATA-2010-Hovland #regular expression
- The Inclusion Problem for Regular Expressions (DH), pp. 309–320.
- LATA-2010-KlunderR #commutative
- Post Correspondence Problem with Partially Commutative Alphabets (BK, WR), pp. 356–367.
- LATA-2010-LetichevskySS #automaton #equivalence #finite #multi #proving #using
- The Equivalence Problem of Deterministic Multitape Finite Automata: A New Proof of Solvability Using a Multidimensional Tape (AAL, ASS, SKS), pp. 392–402.
- LATA-2010-ManeaT #word
- Hard Counting Problems for Partial Words (FM, CT), pp. 426–438.
- RTA-2010-FujitaS #system f
- The Undecidability of Type Related Problems in Type-free Style System F (KeF, AS), pp. 103–118.
- FLOPS-2010-TamuraTB #constraints #satisfiability
- Solving Constraint Satisfaction Problems with SAT Technology (NT, TT, MB), pp. 19–23.
- AIIDE-2010-TutenelSBK #layout #semantics
- A Semantic Scene Description Language for Procedural Layout Solving Problems (TT, RMS, RB, KJdK).
- CIG-2010-Lucas #evolution #learning
- Estimating learning rates in evolution and TDL: Results on a simple grid-world problem (SML), pp. 372–379.
- CHI-2010-EdwardsNP #framework #human-computer
- The infrastructure problem in HCI (WKE, MWN, ESP), pp. 423–432.
- CHI-2010-WangZC #gesture #mobile #named #predict
- SHRIMP: solving collision and out of vocabulary problems in mobile predictive input with motion gesture (JW, SZ, JFC), pp. 15–24.
- CAiSE-2010-BouassidaB #approach #detection
- A New Approach for Pattern Problem Detection (NB, HBA), pp. 150–164.
- ICEIS-AIDSS-2010-MokotoffGP #multi #normalisation
- Normalization Procedures on Multicriteria Decision Making — An Example on Environmental Problems (EM, EG, JP), pp. 206–211.
- ICEIS-DISI-2010-Duin #pattern matching #pattern recognition #recognition
- Pattern Recognition as a Human Centered non-Euclidean Problem (RPWD), p. 5.
- ICEIS-HCI-2010-AstolfiMSA #difference #enterprise #people #using
- Using Cultural Differences to Join People with Common Interests or Problems in Enterprise Environment (GA, VMAdM, MARS, JCA), pp. 192–197.
- ICEIS-J-2010-Duin10a #pattern matching #pattern recognition #recognition
- Non-Euclidean Problems in Pattern Recognition Related to Human Expert Knowledge (RPWD), pp. 15–28.
- ICML-2010-JaggiS #algorithm
- A Simple Algorithm for Nuclear Norm Regularized Problems (MJ, MS), pp. 471–478.
- ICML-2010-ThiaoTA #approach #programming
- A DC Programming Approach for Sparse Eigenvalue Problem (MT, PDT, LTHA), pp. 1063–1070.
- ICML-2010-ThieryS #policy #trade-off
- Least-Squares Policy Iteration: Bias-Variance Trade-off in Control Problems (CT, BS), pp. 1071–1078.
- ICML-2010-XuHFPJ #detection #mining #scalability
- Detecting Large-Scale System Problems by Mining Console Logs (WX, LH, AF, DAP, MIJ), pp. 37–46.
- ICPR-2010-FaradjiWB #approach #classification
- A Simple Approach to Find the Best Wavelet Basis in Classification Problems (FF, RKW, GEB), pp. 641–644.
- ICPR-2010-FreireCF #approach #generative #graph
- A Column Generation Approach for the Graph Matching Problem (ASF, RMCJ, CEF), pp. 1088–1091.
- ICPR-2010-LuoN #classification #fault #learning #multi
- Employing Decoding of Specific Error Correcting Codes as a New Classification Criterion in Multiclass Learning Problems (YL, KN), pp. 4238–4241.
- ICPR-2010-PernekH #polynomial #re-engineering
- Perspective Reconstruction and Camera Auto-Calibration as Rectangular Polynomial Eigenvalue Problem (ÁP, LH), pp. 49–52.
- ICPR-2010-SomolGP #algorithm #feature model #set
- The Problem of Fragile Feature Subset Preference in Feature Selection Methods and a Proposal of Algorithmic Workaround (PS, JG, PP), pp. 4396–4399.
- ICPR-2010-WangS #approach
- The Motion Dynamics Approach to the PnP Problem (BW, FS), pp. 1682–1685.
- KDD-2010-LiuYY #algorithm #performance
- An efficient algorithm for a class of fused lasso problems (JL, LY, JY), pp. 323–332.
- KDD-2010-SozioG #how
- The community-search problem and how to plan a successful cocktail party (MS, AG), pp. 939–948.
- KDIR-2010-PadmajaBK #framework #reduction
- A Class Specific Dimensionality Reduction Framework for Class Imbalance Problem: CPC_SMOTE (TMP, RSB, PRK), pp. 237–242.
- KR-2010-HuL #correctness #reasoning
- A Correctness Result for Reasoning about One-Dimensional Planning Problems (YH, HJL).
- KR-2010-KoniecznyGP #taxonomy
- Taxonomy of Improvement Operators and the Problem of Minimal Change (SK, MMG, RPP).
- RecSys-2010-AlbanesedMPP #modelling #recommendation #social
- Modeling recommendation as a social choice problem (MA, Ad, VM, FP, AP), pp. 329–332.
- SIGIR-2010-Flake #refactoring
- Refactoring the search problem (GWF), p. 250.
- ECMFA-2010-ColomboKL #analysis #case study #modelling #requirements
- Requirements Analysis and Modeling with Problem Frames and SysML: A Case Study (PC, FK, LL), pp. 74–89.
- SPLC-2010-DaoK #approach #component #reuse
- Mapping Features to Reusable Components: A Problem Frames-Based Approach (TMD, KCK), pp. 377–392.
- PEPM-2010-HofmannK #detection #morphism #towards #using
- I/O guided detection of list catamorphisms: towards problem specific use of program templates in IP (MH, EK), pp. 93–100.
- PLDI-2010-GulwaniZ #bound
- The reachability-bound problem (SG, FZ), pp. 292–304.
- POPL-2010-AtigBBM #memory management #modelling #on the #verification
- On the verification problem for weak memory models (MFA, AB, SB, MM), pp. 7–18.
- SIGAda-2010-JemliR #compilation #static analysis #using
- A methodology for avoiding known compiler problems using static analysis (MJ, JPR), pp. 23–30.
- RE-2010-ChenYJ #named
- Dptool: A Tool for Supporting the Problem Description and Projection (XC, BY, ZJ), pp. 401–402.
- RE-2010-Gervasi #design #interactive
- Who Framed Roger User? Problem Frames as a User Interaction Design Tool (VG), pp. 377–378.
- RE-2010-MaidenJKNZM #idea #requirements #research
- Requirements Engineering as Creative Problem Solving: A Research Agenda for Idea Finding (NAMM, SJ, IKK, RN, KZ, AM), pp. 57–66.
- ASE-2010-TrezentosLO #dependence #named #optimisation #pseudo #using
- Apt-pbo: solving the software dependency problem using pseudo-boolean optimization (PT, IL, ALO), pp. 427–436.
- ICSE-2010-SutcliffeT #people #requirements
- Analysing “people” problems in requirements engineering (AGS, ST), pp. 469–470.
- SAC-2010-CarvalhoCB #constraints #probability #reliability
- Probabilistic constraints for reliability problems (EC, JC, PB), pp. 2055–2060.
- SAC-2010-PirkolaT #approach #crawling #using
- Addressing the limited scope problem of focused crawling using a result merging approach (AP, TT), pp. 1735–1740.
- SAC-2010-RiponGHT #approach #layout #multi #using
- Multi-objective evolutionary approach for solving facility layout problem using local search (KSNR, KG, MH, JT), pp. 1155–1156.
- SAC-2010-ToledoOOP #algorithm #parallel #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.
- CASE-2010-FrohlichS #automation #constraints #matrix #modelling #scheduling #using
- Relation matrices for automated MILP modeling of scheduling problems using temporal constraints (RF, SCS), pp. 69–74.
- CASE-2010-LiH #analysis #framework #modelling
- Modeling and analysis of hospital emergency department: An analytical framework and problem formulation (JL, PKH), pp. 897–902.
- CASE-2010-TaoW #3d #algorithm #constraints #heuristic
- A new packing heuristic based algorithm for Vehicle Routing Problem with Three-dimensional Loading constraints (YT, FW), pp. 972–977.
- CASE-2010-XuSY #algorithm
- Exact algorithms for non-overlapping 2-frame problem with non-partial coverage for networked robotic cameras (YX, DS, JY), pp. 503–508.
- DAC-2010-NSRKALPST #question #variability
- Who solves the variability problem? (NN, JCR, JK, RCA, CL, VP, AJS, ST), pp. 218–219.
- DATE-2010-Cota #embedded #question #testing #what
- Embedded software testing: What kind of problem is this? (ÉFC), p. 1486.
- PDP-2010-AmentKWS #framework #parallel #platform
- A Parallel Preconditioned Conjugate Gradient Solver for the Poisson Problem on a Multi-GPU Platform (MA, GK, DW, WS), pp. 583–592.
- PDP-2010-ArmasLM #2d #algorithm #parallel
- Fine and Coarse-grained Parallel Algorithms for the 2D Cutting Stock Problem (JdA, CL, GM), pp. 255–262.
- STOC-2010-BurgisserC #equation #polynomial
- Solving polynomial equations in smoothed polynomial time and a near solution to smale’s 17th problem (PB, FC), pp. 503–512.
- STOC-2010-GodoyGRA #decidability
- The HOM problem is decidable (GG, OG, LR, CÀ), pp. 485–494.
- STOC-2010-Hirai #bound #multi
- The maximum multiflow problems with bounded fractionality (HH), pp. 115–120.
- STOC-2010-HrubesWY #commutative
- Non-commutative circuits and the sum-of-squares problem (PH, AW, AY), pp. 667–676.
- STOC-2010-Madry #algorithm #approximate #graph #multi #performance
- Faster approximation schemes for fractional multicommodity flow problems via dynamic graph algorithms (AM), pp. 121–130.
- STOC-2010-MicciancioV #algorithm #exponential
- A deterministic single exponential time algorithm for most lattice problems based on voronoi cell computations (DM, PV), pp. 351–358.
- STOC-2010-Patrascu #bound #polynomial #towards
- Towards polynomial lower bounds for dynamic problems (MP), pp. 603–610.
- TACAS-2010-LegrielGCM #approximate #multi #optimisation
- Approximating the Pareto Front of Multi-criteria Optimization Problems (JL, CLG, SC, OM), pp. 69–83.
- TACAS-2010-MoyA #calculus #realtime
- Arrival Curves for Real-Time Calculus: The Causality Problem and Its Solutions (MM, KA), pp. 358–372.
- CSL-2010-ChenF #on the #proving #slicing
- On Slicewise Monotone Parameterized Problems and Optimal Proof Systems for TAUT (YC, JF), pp. 200–214.
- CSL-2010-KuskeLL #morphism
- The Isomorphism Problem for ω-Automatic Trees (DK, JL, ML), pp. 396–410.
- ICLP-2010-ShakarianSS10 #network #optimisation #social #source code #using
- Using Generalized Annotated Programs to Solve Social Network Optimization Problems (PS, VSS, MLS), pp. 182–191.
- ICTSS-2010-CabralPV #algorithm #integration #order
- A Pareto Ant Colony Algorithm Applied to the Class Integration and Test Order Problem (RdVC, AP, SRV), pp. 16–29.
- LICS-2010-BargunoCGJV #automaton #constraints
- The Emptiness Problem for Tree Automata with Global Constraints (LB, CC, GG, FJ, CV), pp. 263–272.
- LICS-2010-KuskeLL #automation #morphism
- The Isomorphism Problem on Classes of Automatic Structures (DK, JL, ML), pp. 160–169.
- SAT-2010-BofillSV #constraints #smt
- A System for Solving Constraint Satisfaction Problems with SMT (MB, JS, MV), pp. 300–305.
- SAT-2010-MakinoTY #algorithm
- An Exact Algorithm for the Boolean Connectivity Problem for k-CNF (KM, ST, MY), pp. 172–180.
- SAT-2010-PankratovB #on the #satisfiability
- On the Relative Merits of Simple Local Search Methods for the MAX-SAT Problem (DP, AB), pp. 223–236.
- SAT-2010-PorschenSS #complexity #linear
- Complexity Results for Linear XSAT-Problems (SP, TS, ES), pp. 251–263.
- ICDAR-2009-KaeL #learning #on the fly
- Learning on the Fly: Font-Free Approaches to Difficult OCR Problems (AK, EGLM), pp. 571–575.
- ICDAR-2009-NguyenBL #verification
- Global Features for the Off-Line Signature Verification Problem (VN, MB, GL), pp. 1300–1304.
- VLDB-2009-BorisovBURS #database #named #network
- DIADS: A Problem Diagnosis Tool for Databases and Storage Area Networks (NB, SB, SU, RR, AS), pp. 1546–1549.
- VLDB-2009-DragutFSYM #integration #interface #web #word
- Stop Word and Related Problems in Web Interface Integration (ECD, FF, APS, CTY, WM), pp. 349–360.
- CSEET-2009-RichardsonD #learning #re-engineering
- Problem Based Learning in the Software Engineering Classroom (IR, YD), pp. 174–181.
- EDM-2009-CetintasSXH #correctness #low level #predict
- Predicting Correctness of Problem Solving from Low-level Log Data in Intelligent Tutoring Systems (SC, LS, YPX, CH), pp. 230–239.
- EDM-2009-PardosH #order #random #set
- Determining the Significance of Item Order In Randomized Problem Sets (ZAP, NTH), pp. 111–120.
- ITiCSE-2009-HsiaoSB #java #personalisation
- Extending parameterized problem-tracing questions for Java with personalized guidance (IHH, SAS, PB), p. 392.
- ITiCSE-2009-KiesmullerB #algorithm #automation #identification
- Automatically identifying learners’ problem solving strategies in-process solving algorithmic problems (UK, TB), p. 354.
- ITiCSE-2009-Mirolo #analysis #modelling #recursion
- Mental models of recursive computations vs. recursive analysis in the problem domain (CM), p. 397.
- ITiCSE-2009-RosslingM #social
- Social engineering: a serious underestimated problem (GR, MM), p. 384.
- SIGITE-2009-ArmitageBLG #agile #challenge #delivery #online
- Rapid conversion of an IT degree program to online delivery: impact, problems, solutions and challenges (WDA, NRB, SL, AG), pp. 100–107.
- ICSM-2009-ChanZHS #testing #visualisation
- Visualizing the structure of field testing problems (BC, YZ, AEH, AS), pp. 429–432.
- ICSM-2009-KnabFGP #interactive
- Interactive views for analyzing problem reports (PK, BF, HG, MP), pp. 527–530.
- DLT-2009-BertoniCR #context-free grammar
- The Inclusion Problem of Context-Free Languages: Some Tractable Cases (AB, CC, RR), pp. 103–112.
- DLT-2009-Harju #matrix
- Post Correspondence Problem and Small Dimensional Matrices (TH), pp. 39–46.
- ICALP-v1-2009-AgnarssonHL #algorithm #independence #set
- SDP-Based Algorithms for Maximum Independent Set Problems on Hypergraphs (GA, MMH, EL), pp. 12–23.
- ICALP-v1-2009-AilonL #clustering #correlation #cost analysis #fault
- Correlation Clustering Revisited: The “True” Cost of Error Minimization Problems (NA, EL), pp. 24–36.
- ICALP-v1-2009-BorosM #algorithm #parallel #performance
- A Fast and Simple Parallel Algorithm for the Monotone Duality Problem (EB, KM), pp. 183–194.
- ICALP-v1-2009-HolubN
- The Ehrenfeucht-Silberger Problem (SH, DN), pp. 537–548.
- ICALP-v1-2009-KoutisW #algebra
- Limits and Applications of Group Algebras for Parameterized Problems (IK, RW), pp. 653–664.
- ICALP-v1-2009-Nederlof #algorithm #performance #using
- Fast Polynomial-Space Algorithms Using Möbius Inversion: Improving on Steiner Tree and Related Problems (JN), pp. 713–725.
- ICALP-v2-2009-GottlobGS #optimisation #strict
- Tractable Optimization Problems through Hypergraph-Based Structural Restrictions (GG, GG, FS), pp. 16–30.
- ICALP-v2-2009-KorulaP #algorithm #graph
- Algorithms for Secretary Problems on Graphs and Hypergraphs (NK, MP), pp. 508–520.
- LATA-2009-BergH
- Reoptimization of Traveling Salesperson Problems: Changing Single Edge-Weights (TB, HH), pp. 141–151.
- LATA-2009-BordihnHK #subclass
- Undecidability of Operation Problems for T0L Languages and Subclasses (HB, MH, MK), pp. 236–246.
- LATA-2009-BrzozowskiSX
- Decision Problems for Convex Languages (JAB, JS, ZX), pp. 247–258.
- LATA-2009-GlasserPT #fault tolerance #np-hard
- The Fault Tolerance of NP-Hard Problems (CG, AP, SDT), pp. 374–385.
- LATA-2009-Moore #data access #documentation #generative
- The Halting Problem and Undecidability of Document Generation under Access Control for Tree Updates (NM), pp. 601–613.
- CIG-2009-LopezO #locality #on the #permutation
- On the effects of locality in a permutation problem: The Sudoku Puzzle (EGL, MO0), pp. 80–87.
- CIG-2009-MandziukM #network
- Neural networks compete with expert human players in solving the Double Dummy Bridge Problem (JM, KM), pp. 117–124.
- DiGRA-2009-AndersonBCDLM #game studies #using #video
- Using microgenetic methods to investigate problem solving in video games (AA, CB, KMC, JD, AL, WM).
- CHI-2009-AkersSJW #undo #usability
- Undo and erase events as indicators of usability problems (DA, MS, RJ, TW), pp. 659–668.
- CHI-2009-BinderHS #network #social
- The problem of conflicting social spheres: effects of network structure on experienced tension in social network sites (JB, AH, AGS), pp. 965–974.
- CHI-2009-Guiard #consistency #design #distance
- The problem of consistency in the design of Fitts’ law experiments: consider either target distance and width or movement form and scale (YG), pp. 1809–1818.
- CHI-2009-SellenMLTB #comprehension #interactive #prototype
- The people-prototype problem: understanding the interaction between prototype format and user group (KMS, MM, DML, KNT, SAB), pp. 635–638.
- DHM-2009-Wang #re-engineering
- Problems Encountered in Seated Arm Reach Posture Reconstruction: Need for a More Realistic Spine and Upper Limb Kinematic Model (XW), pp. 160–169.
- HCD-2009-NieminenT #concept #development
- Concept Development with Real Users: Involving Customers in Creative Problem Solving (MPN, MT), pp. 869–878.
- HCI-NIMT-2009-PantforderVS #3d #evaluation #interactive #process #visualisation
- Benefit and Evaluation of Interactive 3D Process Data Visualization for the Presentation of Complex Problems (DP, BVH, KS), pp. 869–878.
- VISSOFT-2009-Reiss #detection #java #memory management #visualisation
- Visualizing the Java heap to detect memory problems (SPR), pp. 73–80.
- CAiSE-2009-Guizzardi #concept #modelling #revisited #transitive
- The Problem of Transitivity of Part-Whole Relations in Conceptual Modeling Revisited (GG), pp. 94–109.
- ICEIS-AIDSS-2009-JuanRMJF
- A Simulation-based Methodology to Assist Decision-makers in Real Vehicle Routing Problems (AAJ, DR, DM, JJ, JF), pp. 212–217.
- ICEIS-HCI-2009-SantosRG #collaboration
- Integrating VR in an Engineering Collaborative Problem Solving Environment (IHFdS, AR, MG), pp. 124–129.
- ICEIS-J-2009-SpahnW #analysis #development #information management
- End-User Development for Individualized Information Management: Analysis of Problem Domains and Solution Approaches (MS, VW), pp. 843–857.
- CIKM-2009-GaoXCA #monitoring #web
- The gardener’s problem for web information monitoring (BJG, MX, WC, DCA), pp. 1525–1528.
- CIKM-2009-LimWW #challenge #database #query #semantics
- Semantic queries in databases: problems and challenges (LL, HW, MW), pp. 1505–1508.
- CIKM-2009-MartineauFJP #classification #difference #using #word
- Improving binary classification on text problems using differential word features (JM, TF, AJ, SP), pp. 2019–2024.
- CIKM-2009-TakamuraO #modelling #summary
- Text summarization model based on the budgeted median problem (HT, MO), pp. 1589–1592.
- ICML-2009-BaillyDR #analysis #component #grammar inference
- Grammatical inference as a principal component analysis problem (RB, FD, LR), pp. 33–40.
- ICML-2009-DiukLL #adaptation #feature model #learning
- The adaptive k-meteorologists problem and its application to structure learning and feature selection in reinforcement learning (CD, LL, BRL), pp. 249–256.
- ICML-2009-SunJY #machine learning
- A least squares formulation for a class of generalized eigenvalue problems in machine learning (LS, SJ, JY), pp. 977–984.
- ICML-2009-YueJ #information retrieval #optimisation
- Interactively optimizing information retrieval systems as a dueling bandits problem (YY, TJ), pp. 1201–1208.
- ICML-2009-YuM
- Piecewise-stationary bandit problems with side observations (JYY, SM), pp. 1177–1184.
- KDD-2009-BackstromKK #optimisation #scheduling #web
- Optimizing web traffic via the media scheduling problem (LB, JMK, RK), pp. 89–98.
- KEOD-2009-TsalapatiSK #approximate #ontology #reuse
- A Method for Approximation to Ontology Reuse Problem (ET, GBS, GK), pp. 416–419.
- KMIS-2009-SonntagM #image #information management #query #repository #semantics
- Unifying Semantic Annotation and Querying in Biomedical Image Repositories — One Solution for Two Problems of Medical Knowledge Engineering (DS, MM), pp. 89–94.
- MLDM-2009-MorelandT09a
- The Needles-in-Haystack Problem (KM, KT), pp. 516–524.
- RecSys-2009-ConryKR #recommendation
- Recommender systems for the conference paper assignment problem (DC, YK, NR), pp. 357–360.
- SEKE-2009-GaoSSVPDB #assessment #estimation #risk management
- Systematic Risk Assessment and Cost Estimation for Software Problems (JG, MS, MS, DV, PP, KD, EB), pp. 103–109.
- SIGIR-2009-TrotmanCL #topic #visualisation
- Visualizing the problems with the INEX topics (AT, MdRGC, ML), p. 826.
- SIGIR-2009-YangGH #identification #information retrieval
- Protein identification as an information retrieval problem (YY, SG, AH), pp. 752–753.
- MoDELS-2009-HorvathV #constraints #csp #modelling
- CSP(M): Constraint Satisfaction Problem over Models (ÁH, DV), pp. 107–121.
- SPLC-2009-KastnerARRBS #analysis #case study #on the
- On the impact of the optional feature problem: analysis and case studies (CK, SA, SSuR, MR, DSB, GS), pp. 181–190.
- SPLC-2009-WhiteDSB #automation #feature model #multi #reasoning
- Automated reasoning for multi-step feature model configuration problems (JW, BD, DCS, DB), pp. 11–20.
- MoDELS-2009-HorvathV #constraints #csp #modelling
- CSP(M): Constraint Satisfaction Problem over Models (ÁH, DV), pp. 107–121.
- PADL-2009-XiFWZ #ad hoc #ambiguity
- Ad Hoc Data and the Token Ambiguity Problem (QX, KF, DW, KQZ), pp. 91–106.
- PLDI-2009-LivshitsNRB #data flow #named #specification
- Merlin: specification inference for explicit information flow problems (VBL, AVN, SKR, AB), pp. 75–86.
- SIGAda-2009-Barkstrom #ada #algorithm #concurrent #multi #on the #using
- On using Ada to solve problems in computational economics and related disciplines with concurrent, multiagent algorithms (BRB), pp. 61–72.
- RE-2009-TunJLNY #using
- Are Your Lights Off? Using Problem Frames to Diagnose System Failures (TTT, MJ, RCL, BN, YY), pp. 343–348.
- REFSQ-2009-TunYLN #approach #identification #interactive
- Early Identification of Problem Interactions: A Tool-Supported Approach (TTT, YY, RCL, BN), pp. 74–88.
- ESEC-FSE-2009-KnabKP
- Smart views for analyzing problem reports: tool demo (PK, HG, MP), pp. 289–290.
- ICSE-2009-ChangMP #component #integration #off the shelf
- In-field healing of integration problems with COTS components (HC, LM, MP), pp. 166–176.
- SAC-2009-AgentA #approach
- Extending Problem Frames to deal with stakeholder problems: An Agent- and Goal-Oriented Approach (SS, LC), pp. 389–394.
- SAC-2009-BangerthJ #adaptation #finite
- Adaptive finite element methods for nonlinear inverse problems (WB, AJ), pp. 1002–1006.
- SAC-2009-Brand #composition #constraints #matrix
- The sum-of-increments constraint in the consecutive-ones matrix decomposition problem (SB), pp. 1417–1418.
- SAC-2009-BuckerRRW #automation #parallel #simulation
- Semi-automatic parallelization of direct and inverse problems for geothermal simulation (HMB, AR, VR, AW), pp. 971–975.
- SAC-2009-LavorLMM #distance #geometry #on the #subclass
- On a discretizable subclass of instances of the molecular distance geometry problem (CL, LL, AM, NM), pp. 804–805.
- SAC-2009-TangL
- The unique solution for
*P3P*problem (JT, NL), pp. 1138–1139. - GPCE-2009-NedunuriC #performance #source code #synthesis
- Synthesis of fast programs for maximum segment sum problems (SN, WRC), pp. 117–126.
- GPCE-2009-SanenTJ #approach #feature model #interactive
- Mapping problem-space to solution-space features: a feature interaction approach (FS, ET, WJ), pp. 167–176.
- SLE-2009-Bezivin #question #what
- If MDE Is the Solution, Then What Is the Problem? (JB), p. 2.
- CASE-2009-GirishJ #algorithm #flexibility #optimisation #scheduling
- A particle swarm optimization algorithm for flexible job shop scheduling problem (BSG, NJ), pp. 298–303.
- CASE-2009-KhawP #assembly #multi #optimisation
- Multi-rule multi-objective Ant Colony Optimization for straight and U-type assembly line balancing problem (CLEK, SGP), pp. 177–182.
- CASE-2009-SinghR #behaviour
- The Potluck Problem with consumers’ choice behavior (NS, SR), pp. 328–333.
- CASE-2009-WuCCW #heuristic
- Heuristic for lane reservation problem in time constrained transportation (YW, CC, FC, NW), pp. 543–548.
- CASE-2009-WuS #heuristic #multi
- A new heuristic method for capacitated multi-level lot sizing problem with backlogging (TW, LS), pp. 483–488.
- DAC-2009-AmadorPR #architecture #memory management
- Optimum LDPC decoder: a memory architecture problem (EA, RP, VR), pp. 891–896.
- DAC-2009-PellauerACE #composition
- Soft connections: addressing the hardware-design modularity problem (MP, MA, DC, JSE), pp. 276–281.
- DAC-2009-StapletonT #component #design #reuse #verification
- Verification problems in reusing internal design components (WS, PT), pp. 209–211.
- DATE-2009-KwonYUJ #performance
- In-network reorder buffer to improve overall NoC performance while resolving the in-order requirement problem (WCK, SY, JU, SWJ), pp. 1058–1063.
- SOSP-2009-XuHFPJ #detection #mining #scalability
- Detecting large-scale system problems by mining console logs (WX, LH, AF, DAP, MIJ), pp. 117–132.
- ESOP-2009-YuanE #algorithm #performance #reachability
- An Efficient Algorithm for Solving the Dyck-CFL Reachability Problem on Trees (HY, PTE), pp. 175–189.
- FASE-2009-FullebornMH #design pattern #documentation
- Problem-Oriented Documentation of Design Patterns (AF, KM, MH), pp. 294–308.
- FoSSaCS-2009-Thomas #synthesis
- Facets of Synthesis: Revisiting Church’s Problem (WT), pp. 1–14.
- STOC-2009-CaiLX #csp
- Holant problems and counting CSP (JyC, PL, MX), pp. 715–724.
- STOC-2009-ChengW #distance #reduction
- A deterministic reduction for the gap minimum distance problem: [extended abstract] (QC, DW), pp. 33–38.
- STOC-2009-KarpinskiS #approximate #game studies #linear
- Linear time approximation schemes for the Gale-Berlekamp game and related minimization problems (MK, WS), pp. 313–322.
- STOC-2009-Peikert #worst-case
- Public-key cryptosystems from the worst-case shortest vector problem: extended abstract (CP), pp. 333–342.
- CSL-2009-AtseriasW #consistency #constraints #decidability
- Decidable Relationships between Consistency Notions for Constraint Satisfaction Problems (AA, MW), pp. 102–116.
- CSL-2009-CockettS #communication #on the #word
- On the Word Problem for ΣΠ-Categories, and the Properties of Two-Way Communication (JRBC, LS), pp. 194–208.
- CSL-2009-DuparcFM #automaton #decidability #game studies #linear
- Linear Game Automata: Decidable Hierarchy Problems for Stripped-Down Alternating Tree Automata (JD, AF, FM), pp. 225–239.
- CSL-2009-Rabinovich #decidability
- Decidable Extensions of Church’s Problem (AR), pp. 424–439.
- CSL-2009-UmmelsW #game studies #nash #probability
- Decision Problems for Nash Equilibria in Stochastic Games (MU, DW), pp. 515–529.
- LICS-2009-ChenF #logic
- A Logic for PTIME and a Parameterized Halting Problem (YC, JF), pp. 397–406.
- LICS-2009-Clarke #explosion
- My 27-year Quest to Overcome the State Explosion Problem (EMC), p. 3.
- LICS-2009-KazakovP #complexity #logic #satisfiability
- A Note on the Complexity of the Satisfiability Problem for Graded Modal Logics (YK, IPH), pp. 407–416.
- LICS-2009-Leroux #induction #invariant #reachability
- The General Vector Addition System Reachability Problem by Presburger Inductive Invariants (JL), pp. 4–13.
- LICS-2009-PaganiT #linear #logic
- The Inverse Taylor Expansion Problem in Linear Logic (MP, CT), pp. 222–231.
- SAT-2009-BalintHG #approach #novel #satisfiability
- A Novel Approach to Combine a SLS- and a DPLL-Solver for the Satisfiability Problem (AB, MH, OG), pp. 284–297.
- SAT-2009-SinzI #heuristic
- Problem-Sensitive Restart Heuristics for the DPLL Procedure (CS, MI), pp. 356–362.
- SAT-2009-SoosNC #encryption #satisfiability
- Extending SAT Solvers to Cryptographic Problems (MS, KN, CC), pp. 244–257.
- VMCAI-2009-DimoulasW #higher-order
- The Higher-Order Aggregate Update Problem (CD, MW), pp. 44–58.
- VMCAI-2009-Emerson #model checking
- Model Checking: Progress and Problems (EAE), p. 1.
- DocEng-2008-LaenderGCFSS #library
- Keeping a digital library clean: new solutions to old problems (AHFL, MAG, RGC, AAF, RLTS, AJCS), pp. 257–262.
- ECDL-2008-LinHLLWC #web
- A Mechanism for Solving the Unencoded Chinese Character Problem on the Web (TJL, JWH, CL, HYL, HAW, CYC), pp. 419–422.
- PODS-2008-LiuPRY #algorithm
- A generic flow algorithm for shared filter ordering problems (ZL, SP, AR, HY), pp. 79–88.
- VLDB-2008-ShaoCTYA #enterprise #named #recommendation
- EasyTicket: a ticket routing recommendation engine for enterprise problem resolution (QS, YC, ST, XY, NA), pp. 1436–1439.
- CSEET-2008-RyooFJ #design #education #game studies #learning #object-oriented #re-engineering
- Teaching Object-Oriented Software Engineering through Problem-Based Learning in the Context of Game Design (JR, FF, DSJ), pp. 137–144.
- ITiCSE-2008-KiesmullerB #algorithm #analysis #how
- How do 7th graders solve algorithmic problems?: a tool-based analysis (UK, TB), p. 353.
- ITiCSE-2008-Rubio-Sanchez #combinator #equivalence
- An introduction to problem equivalence with combinatorics (MRS), p. 313.
- ICSM-2008-JiangHHF #automation #identification #testing
- Automatic identification of load testing problems (ZMJ, AEH, GH, PF), pp. 307–316.
- PASTE-2008-ShonleGL
- Addressing common crosscutting problems with Arcum (MS, WGG, SL), pp. 64–69.
- AFL-2008-BreveglieriCNR #equation #satisfiability
- NP-completeness of the alphabetical satisfiability problem for trace equations (LB, AC, CDN, ER), pp. 111–121.
- AFL-2008-Lohrey #revisited
- Compressed membership problems revisited (ML), pp. 31–53.
- AFL-2008-Martyugin #automaton #commutative #complexity #word
- Complexity of problems concerning reset words for commutative automata and automata with simple idempotents (PVM), pp. 314–324.
- DLT-2008-CarpiD #automaton #transitive
- The Synchronization Problem for Strongly Transitive Automata (AC, FD), pp. 240–251.
- DLT-2008-FreydenbergerR
- Bad News on Decision Problems for Patterns (DDF, DR), pp. 327–338.
- DLT-2008-Shallit
- The Frobenius Problem and Its Generalizations (JS), pp. 72–83.
- ICALP-A-2008-BjorklundHKK #bound #graph
- The Travelling Salesman Problem in Bounded Degree Graphs (AB, TH, PK, MK), pp. 198–209.
- ICALP-A-2008-BlellochVW #approach #combinator #graph
- A New Combinatorial Approach for Sparse Graph Problems (GEB, VV, RW), pp. 108–120.
- ICALP-A-2008-BodlaenderDFH #kernel #on the #polynomial
- On Problems without Polynomial Kernels (HLB, RGD, MRF, DH), pp. 563–574.
- ICALP-A-2008-BorradaileK #graph #network
- The Two-Edge Connectivity Survivable Network Problem in Planar Graphs (GB, PNK), pp. 485–501.
- ICALP-A-2008-Briest
- Uniform Budgets and the Envy-Free Pricing Problem (PB), pp. 808–819.
- ICALP-A-2008-Bulatov #complexity #constraints
- The Complexity of the Counting Constraint Satisfaction Problem (AAB), pp. 646–661.
- ICALP-A-2008-ChekuriK #algorithm
- Algorithms for 2-Route Cut Problems (CC, SK), pp. 472–484.
- ICALP-A-2008-FialaGK #complexity #distance
- Computational Complexity of the Distance Constrained Labeling Problem for Trees (JF, PAG, JK), pp. 294–305.
- ICALP-A-2008-Koutis #algebra #algorithm #performance
- Faster Algebraic Algorithms for Path and Packing Problems (IK), pp. 575–586.
- ICALP-C-2008-GilbertRS #how
- How to Encrypt with the LPN Problem (HG, MJBR, YS), pp. 679–690.
- LATA-2008-BaumeisterR #reduction
- The Three-Color and Two-Color TantrixTM Rotation Puzzle Problems Are NP-Complete Via Parsimonious Reductions (DB, JR), pp. 76–87.
- LATA-2008-Yoshinaka #algorithm #performance #subclass
- An Efficient Algorithm for the Inclusion Problem of a Subclass of DPDAs (RY), pp. 487–498.
- ICFP-2008-Krauss #data type #recursion
- Pattern minimization problems over recursive data types (AK), pp. 267–274.
- GT-VC-2007-Pennemann08 #algorithm #approximate #satisfiability
- An Algorithm for Approximating the Satisfiability Problem of High-level Conditions (KHP), pp. 75–94.
- ICGT-2008-ChalopinMM #graph
- Labelled (Hyper)Graphs, Negotiations and the Naming Problem (JC, AWM, YM), pp. 54–68.
- CSCW-2008-ONeillMCRW
- Colour management is a socio-technical problem (JO, DBM, TC, FR, JW), pp. 599–608.
- SOFTVIS-2008-WettelL #design #visual notation
- Visually localizing design problems with disharmony maps (RW, ML), pp. 155–164.
- ICEIS-AIDSS-2008-PanahiT #clustering #hybrid #performance
- An Efficient Hybrid Method for Clustering Problems (HP, RTM), pp. 288–294.
- ICEIS-ISAS2-2008-Venable #analysis #requirements
- Improving Requirements Analysis — Rigourous Problem Analysis and Formulation with Coloured Cognitive Maps (JRV), pp. 466–470.
- CIKM-2008-Croft #approach #how
- Unsolved problems in search: (and how we approach them) (WBC), p. 1001.
- ICPR-2008-GhoshB #evolution #how #pattern matching #pattern recognition #recognition
- How current BNs fail to represent evolvable pattern recognition problems and a proposed solution (NG, BB), pp. 1–4.
- ICPR-2008-IlayarajaNJ #implementation #performance #scalability
- Efficient implementation of SVM for large class problems (PI, NVN, CVJ), pp. 1–4.
- KDD-2008-ChenW #classification #feature model #metric #named #performance
- FAST: a roc-based feature selection metric for small samples and imbalanced data classification problems (XwC, MW), pp. 124–132.
- KDD-2008-DavisD #learning #metric
- Structured metric learning for high dimensional problems (JVD, ISD), pp. 195–203.
- RecSys-2008-TakacsPNT #algorithm #matrix
- Matrix factorization and neighbor based algorithms for the netflix prize problem (GT, IP, BN, DT), pp. 267–274.
- RecSys-2008-YildirimK #collaboration #random
- A random walk method for alleviating the sparsity problem in collaborative filtering (HY, MSK), pp. 131–138.
- SEKE-2008-ChenLMW #algorithm #case study #optimisation #polynomial #verification
- Verification of Optimization Algorithms: a Case Study of a Quadratic Assignment Problem Solver (TYC, HL, RGM, DW), pp. 16–21.
- SEKE-2008-DingZ #case study #explosion
- A Study of the Model Explosion Problem in CTL Model Update (YD, YZ), pp. 752–757.
- SEKE-2008-ParkK08a #satisfiability
- Japanese Puzzle as a SAT Problem (SP, GK), pp. 543–548.
- MoDELS-2008-HateburHS #metamodelling
- A Formal Metamodel for Problem Frames (DH, MH, HS), pp. 68–82.
- MoDELS-2008-KessentiniSB #model transformation #optimisation
- Model Transformation as an Optimization Problem (MK, HAS, MB), pp. 159–173.
- MoDELS-2008-HateburHS #metamodelling
- A Formal Metamodel for Problem Frames (DH, MH, HS), pp. 68–82.
- MoDELS-2008-KessentiniSB #model transformation #optimisation
- Model Transformation as an Optimization Problem (MK, HAS, MB), pp. 159–173.
- PEPM-2008-Mu #algorithm #bound
- Maximum segment sum is back: deriving algorithms for two segment problems with bounded lengths (SCM), pp. 31–39.
- SIGAda-2008-Maurer #ada #source code
- Removing backward go-to statements from Ada programs: possibilities and problems (WDM), pp. 105–108.
- RE-2008-HoWR #fault #performance #requirements
- Examining the Relationships between Performance Requirements and “Not a Problem” Defect Reports (CWH, LW, BR), pp. 135–144.
- RE-2008-JuretaMF #ontology #requirements
- Revisiting the Core Ontology and Problem in Requirements Engineering (IJ, JM, SF), pp. 71–80.
- RE-2008-LencastreMAC #aspect-oriented #composition
- Aspects Composition in Problem Frames (ML, AMDM, JA, JC), pp. 343–344.
- REFSQ-2008-WelshS #adaptation #identification
- When to Adapt? Identification of Problem Domains for Adaptive Systems (KW, PS), pp. 198–203.
- SAC-2008-Denner-Broser #algorithm #analysis #using
- An algorithm for the tracing problem using interval analysis (BDB), pp. 1832–1837.
- SAC-2008-MeiraM #clustering
- A continuous facility location problem and its application to a clustering problem (LAAM, FKM), pp. 1826–1831.
- SAC-2008-OliveiraRSCBM #heuristic
- A vehicular waiting time heuristic for dynamic vehicle routing problem (HCBdO, GMR, MMdS, LAC, VRB, GRM), pp. 13–17.
- SAC-2008-PetrilloPTD #development #game studies #overview
- Houston, we have a problem...: a survey of actual problems in computer games development (FP, MSP, FMT, CD), pp. 707–711.
- SAC-2008-RoyS #data flow
- Improving flow-insensitive solutions for non-separable dataflow problems (SR, YNS), pp. 211–216.
- SAC-2008-TanWWC #detection #semantics #using
- Using unlabeled data to handle domain-transfer problem of semantic detection (ST, YW, GW, XC), pp. 896–903.
- SAC-2008-ToledoFR #algorithm #scheduling #search-based
- Evaluating genetic algorithms with different population structures on a lot sizing and scheduling problem (CFMT, PMF, KAR), pp. 1777–1781.
- SAC-2008-VasiraniO #coordination #distributed
- Decentralized coordination strategies for the vehicle routing problem (MV, SO), pp. 130–131.
- CASE-2008-ArnaoutMR #algorithm #optimisation #parallel #scheduling
- Ant colony optimization algorithm to parallel machine scheduling problem with setups (JPA, RM, GR), pp. 578–582.
- CASE-2008-CamponogaraP #generative #scheduling
- Column generation for solving a compressor scheduling problem (EC, AP), pp. 796–801.
- CASE-2008-ChenS
- A variant of examination timetabling problem (WC, LS), pp. 353–358.
- CASE-2008-HuLH #enterprise #modelling #overview #towards
- Towards modeling of resilience dynamics in manufacturing enterprises: Literature review and problem formulation (YH, JL, LEH), pp. 279–284.
- CASE-2008-SakuraiOKT #algorithm #delivery #multi #search-based
- A multi-inner-world Genetic Algorithm to optimize delivery problem with interactive-time (YS, TO, SK, ST), pp. 583–590.
- CASE-2008-TeoP #heuristic #hybrid #layout
- A hybrid ACO/PSO heuristic to solve single row layout problem (YTT, SGP), pp. 597–602.
- CASE-2008-WengF #algorithm #evolution #scheduling
- Self evolution algorithm for common due date scheduling problem (WW, SF), pp. 790–795.
- CASE-2008-XuFWY #algorithm #multi
- An Or-opt NSGA-II algorithm for multi-objective Vehicle Routing Problem with Time Windows (HX, WF, TW, LY), pp. 309–314.
- DAC-2008-PuriVEWFYK #question
- Keeping hot chips cool: are IC thermal problems hot air? (RP, DV, DE, AJW, PDF, AY, SVK), pp. 634–635.
- DATE-2008-AvnitDSRP #approach #formal method #protocol
- A Formal Approach To The Protocol Converter Problem (KA, VD, AS, SR, SP), pp. 294–299.
- DATE-2008-VelevG #comparison #encoding #satisfiability
- Comparison of Boolean Satisfiability Encodings on FPGA Detailed Routing Problems (MNV, PG), pp. 1268–1273.
- DATE-2008-WolffPBC #analysis #detection #towards
- Towards Trojan-Free Trusted ICs: Problem Analysis and Detection Scheme (FGW, CAP, SB, RSC), pp. 1362–1365.
- PDP-2008-Chaves-GonzalezDRPS #network
- Parallelizing PBIL for Solving a Real-World Frequency Assignment Problem in GSM Networks (JMCG, DDG, MÁVR, JAGP, JMSP), pp. 391–398.
- PDP-2008-LeonMRS #2d #algorithm #distributed #parallel
- A Distributed Parallel Algorithm to Solve the 2D Cutting Stock Problem (CL, GM, CR, CS), pp. 429–434.
- FoSSaCS-2008-AntonikHLNW #complexity #specification
- Complexity of Decision Problems for Mixed and Modal Specifications (AA, MH, KGL, UN, AW), pp. 112–126.
- FoSSaCS-2008-BaierBG #automaton #on the #probability
- On Decision Problems for Probabilistic Büchi Automata (CB, NB, MG), pp. 287–301.
- FoSSaCS-2008-ChambartS
- The ω-Regular Post Embedding Problem (PC, PS), pp. 97–111.
- STOC-2008-AttiyaHW #bound
- Tight rmr lower bounds for mutual exclusion and other problems (HA, DH, PW), pp. 217–226.
- STOC-2008-BartoKN #complexity #graph #morphism
- Graphs, polymorphisms and the complexity of homomorphism problems (LB, MK, TN), pp. 789–796.
- STOC-2008-BodirskyK #complexity #constraints
- The complexity of temporal constraint satisfaction problems (MB, JK), pp. 29–38.
- STOC-2008-CaiCL #bound #exclamation #polynomial
- A quadratic lower bound for the permanent and determinant problem over any characteristic != 2 (JyC, XC, DL), pp. 491–498.
- STOC-2008-ChenLL #algorithm #feedback #parametricity #set
- A fixed-parameter algorithm for the directed feedback vertex set problem (JC, YL, SL, BO, IR), pp. 177–186.
- STOC-2008-ColeF #algorithm
- Fast-converging tatonnement algorithms for one-time and ongoing market problems (RC, LF), pp. 315–324.
- STOC-2008-FakcharoenpholL #algorithm #approximate
- An o(log2 k)-approximation algorithm for the k-vertex connected spanning subgraph problem (JF, BL), pp. 153–158.
- STOC-2008-ODonnellS #parametricity
- The chow parameters problem (RO, RAS), pp. 517–526.
- STOC-2008-Vondrak #approximate
- Optimal approximation for the submodular welfare problem in the value oracle model (JV), pp. 67–74.
- CSL-2008-ColcombetL #calculus #μ-calculus
- The Nesting-Depth of Disjunctive μ-Calculus for Tree Languages and the Limitedness Problem (TC, CL), pp. 416–430.
- CSL-2008-CreignouSS #constraints
- Non-uniform Boolean Constraint Satisfaction Problems with Cardinality Constraint (NC, HS, IS), pp. 109–123.
- ICLP-2008-CodishLS #constraints #partial order
- Telecommunications Feature Subscription as a Partial Order Constraint Problem (MC, VL, PJS), pp. 749–753.
- IJCAR-2008-KonevWW #difference #logic
- The Logical Difference Problem for Description Logic Terminologies (BK, DW, FW), pp. 259–274.
- LICS-2008-BrazdilFKK #probability #satisfiability
- The Satisfiability Problem for Probabilistic CTL (TB, VF, JK, AK), pp. 391–402.
- LICS-2008-CarvalhoDK #constraints
- Caterpillar Duality for Constraint Satisfaction Problems (CC, VD, AAK), pp. 307–316.
- LICS-2008-ChenMM #constraints #quantifier
- Quantified Constraints and Containment Problems (HC, FRM, BM), pp. 317–328.
- SAT-2008-Gao #algorithm #complexity #random
- Random Instances of W[2]-Complete Problems: Thresholds, Complexity, and Algorithms (YG), pp. 91–104.
- HT-2007-MelguizoOJ #navigation #predict #web
- Predicting and solving web navigation problems (MCPM, HvO, IJ), pp. 47–48.
- ITiCSE-2007-ByrdCCKK #student
- Solving recurring student problems with recurrences (JB, MC, DC, PK, MJK), p. 343.
- ITiCSE-2007-ChinnSM #algorithm #data type #performance #student
- Problem solving and student performance in data structures and algorithms (DDC, CS, KM), pp. 241–245.
- ITiCSE-2007-MullerGH #composition
- Pattern-oriented instruction and its influence on problem decomposition and solution construction (OM, DG, BH), pp. 151–155.
- SIGITE-2007-ChaKL #abstraction #using
- Using puzzles: problem-solving and abstraction (SC, DK, WGL), pp. 135–140.
- CIAA-2007-IliopoulosRVV #sequence #string
- The Constrained Longest Common Subsequence Problem for Degenerate Strings (CSI, MSR, MV, LV), pp. 309–311.
- ICALP-2007-AlonFGKS #algorithm
- Parameterized Algorithms for Directed Maximum Leaf Problems (NA, FVF, GG, MK, SS), pp. 352–362.
- ICALP-2007-BozzelliT #automaton #bound #parametricity
- Decision Problems for Lower/Upper Bound Parametric Timed Automata (LB, SLT), pp. 925–936.
- ICALP-2007-BurgisserC #complexity #quantifier
- Exotic Quantifiers, Complexity Classes, and Complete Problems (PB, FC), pp. 207–218.
- ICALP-2007-GroheG
- Parameterized Approximability of the Disjoint Cycle Problem (MG, MG), pp. 363–374.
- ICALP-2007-GuoN #graph #kernel #linear #np-hard
- Linear Problem Kernels for NP-Hard Problems on Planar Graphs (JG, RN), pp. 375–386.
- ICALP-2007-KatrielKU #nondeterminism #probability
- Commitment Under Uncertainty: Two-Stage Stochastic Matching Problems (IK, CKM, EU), pp. 171–182.
- ICALP-2007-LaroseT #algebra #constraints
- Universal Algebra and Hardness Results for Constraint Satisfaction Problems (BL, PT), pp. 267–278.
- LATA-2007-LohreyS #graph #set
- The submonoid and rational subset membership problems for graph groups (ML, BS), pp. 367–378.
- SEFM-2007-HallRJ #framework #re-engineering
- Problem Oriented Software Engineering: A design-theoretic framework for software engineering (JGH, LR, MJ), pp. 15–24.
- SFM-2007-Smith #performance
- Introduction to Software Performance Engineering: Origins and Outstanding Problems (CUS), pp. 395–428.
- TLCA-2007-Kusmierek #rank
- The Inhabitation Problem for Rank Two Intersection Types (DK), pp. 240–254.
- CHI-2007-SeayK #game studies #online #self #using
- Project massive: self-regulation and problematic use of online gaming (AFS, REK), pp. 829–838.
- HCI-AS-2007-Kilic #user interface
- “My Money in E-Purse” Searching Problems in Self Service User Interface (EK), pp. 58–66.
- HCI-IDU-2007-FujiokaTKO #coordination #detection #usability
- Tool for Detecting Webpage Usability Problems from Mouse Click Coordinate Logs (RF, RT, YK, HO), pp. 438–445.
- HCI-IDU-2007-HwangS #detection #usability #what
- What Makes Evaluators to Find More Usability Problems?: A Meta-analysis for Individual Detection Rates (WH, GS), pp. 499–507.
- HCI-IPT-2007-KellenCF #probability
- Facilitating Conditional Probability Problems with Visuals (VK, SSC, XF), pp. 63–71.
- HCI-MIE-2007-BaranDC #approach #eye tracking #how
- How Do Adults Solve Digital Tangram Problems? Analyzing Cognitive Strategies Through Eye Tracking Approach (BB, BD, KÇ), pp. 555–563.
- HIMI-IIE-2007-LazzariB #education #experience #guidelines #quality #towards
- Towards Guidelines on Educational Podcasting Quality: Problems Arising from a Real World Experience (ML, AB), pp. 404–412.
- ICEIS-AIDSS-2007-CastroO #distributed #multi
- A Distributed Multi-Agent System to Solve Airline Operations Problems (AJMC, EO), pp. 22–30.
- ICEIS-AIDSS-2007-CuellarDP #algorithm #hybrid #network
- Problems and Features of Evolutionary Algorithms to Build Hybrid Training Methods for Recurrent Neural Networks (MPC, MD, MdCPJ), pp. 204–211.
- ICEIS-DISI-2007-ChristianssonS #open data #standard
- Problems with non-open data standards in swedish municipals — when integrating and adopting systems (BC, FS), pp. 264–267.
- ICEIS-EIS-2007-AmritH #detection #matrix #process
- Matrix Based Problem Detection in the Application of Software Process Patterns (CA, JvH), pp. 316–320.
- ICEIS-EIS-2007-Custers #profiling
- Risk Profiling of Money Laundering and Terrorism Funding — Practical Problems of Current Information Strategies (BHMC), pp. 90–94.
- ICEIS-J-2007-CastroO07a #distributed #multi #using
- Solving Airline Operations Problems Using Specialized Agents in a Distributed Multi-Agent System (AJMC, ECO), pp. 173–184.
- ICEIS-SAIC-2007-Maximilien #approach #challenge #ruby #semantics #using #web #web service
- A Partial Solution to the Semantic Web Services Challenge Problem Using Swashup — The Ruby on Rails Services Mashup Approach (EMM), pp. 438–446.
- CIKM-2007-TanWTC #analysis #novel #sentiment
- A novel scheme for domain-transfer problem in the context of sentiment analysis (ST, GW, HT, XC), pp. 979–982.
- ECIR-2007-Silvestri #documentation #identifier #sorting
- Sorting Out the Document Identifier Assignment Problem (FS), pp. 101–112.
- ICML-2007-LarochelleECBB #architecture #empirical #evaluation
- An empirical evaluation of deep architectures on problems with many factors of variation (HL, DE, ACC, JB, YB), pp. 473–480.
- ICML-2007-PandeyCA #multi
- Multi-armed bandit problems with dependent arms (SP, DC, DA), pp. 721–728.
- KDD-2007-GaoESCX #consistency #data mining #mining #set
- The minimum consistent subset cover problem and its applications in data mining (BJG, ME, JyC, OS, HX), pp. 310–319.
- MLDM-2007-LeeP #multi #on the #reduction
- On Applying Dimension Reduction for Multi-labeled Problems (ML, CHP), pp. 131–143.
- SIGIR-2007-ErtekinHG #learning
- Active learning for class imbalance problem (SE, JH, CLG), pp. 823–824.
- SIGIR-2007-Feng #clustering #documentation #optimisation
- Document clustering: an optimization problem (AF), pp. 819–820.
- SIGIR-2007-SandersonS
- Problems with Kendall’s tau (MS, IS), pp. 839–840.
- PADL-2007-BarahonaK #approach #constraints #programming
- A Constraint Programming Approach to Bioinformatics Structural Problems (PB, LK), pp. 33–49.
- PPDP-2007-LushmanC #decidability
- A larger decidable semiunification problem (BL, GVC), pp. 143–152.
- RE-2007-SalifuYN #monitoring #specification
- Specifying Monitoring and Switching Problems in Context (MS, YY, BN), pp. 211–220.
- RE-2007-Sutcliffe #requirements
- Requirements in the Global Economy-Experience, Problems and Prospects (AGS), pp. 359–360.
- SAC-2007-MouhoubS #constraints
- Solving conditional and composite constraint satisfaction problems (MM, AS), pp. 336–337.
- SAC-2007-Suzuki #approach
- An edit operation-based approach to the inclusion problem for DTDs (NS), pp. 482–488.
- SAC-2007-ViroliCG #distributed #self #tuple
- A self-organising solution to the collective sort problem in distributed tuple spaces (MV, MC, LG), pp. 354–359.
- SAC-2007-ZengS #combinator #geometry #optimisation
- Semi-mechanization method for a unsolved optimization problem in combinatorial geometry (ZZ, MS), pp. 762–766.
- SAC-2007-ZhangMMB #locality #network #performance #self #using
- Performance problem localization in self-healing, service-oriented systems using Bayesian networks (RZ, SM, SM, AB), pp. 104–109.
- CASE-2007-ChengOKKO #algorithm #scheduling
- Simulated Annealing Algorithm for Daily Nursing Care Scheduling Problem (MC, HIO, NK, KK, JO), pp. 507–512.
- CASE-2007-GuHSX #assembly #estimation
- Assembly Line Balancing Problems Solved by Estimation of Distribution (LG, SH, AS, XX), pp. 123–127.
- CASE-2007-GuLZF #approach #scheduling
- Dynamic Local Focusing Approach for Production Scheduling Problems (PG, YL, XZ, SF), pp. 466–471.
- CASE-2007-NishiHI #scheduling
- A Successive Lagrangian Relaxation Method for Solving Flowshop Scheduling Problems with Total Weighted Tardiness (TN, YH, MI), pp. 875–880.
- CASE-2007-ShiomiSOOYKI #2d #process
- The Solution of 2-Dimensional Rectangular Cutting Stock Problem Considering Cutting Process (YS, MS, JO, TO, MY, HK, KI), pp. 140–145.
- CASE-2007-YogeswaranPT #algorithm #heuristic #hybrid #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.
- CGO-2007-OzturkCKK #latency
- Compiler-Directed Variable Latency Aware SPM Management to CopeWith Timing Problems (ÖÖ, GC, MTK, MK), pp. 232–243.
- HPDC-2007-MaassenB #grid #named
- Smartsockets: solving the connectivity problems in grid computing (JM, HEB), pp. 1–10.
- FoSSaCS-2007-Rosu #algorithm #effectiveness #regular expression
- An Effective Algorithm for the Membership Problem for Extended Regular Expressions (GR), pp. 332–345.
- STOC-2007-AgarwalAC #approximate
- Improved approximation for directed cut problems (AA, NA, MC), pp. 671–680.
- STOC-2007-ChuzhoyK #polynomial
- Polynomial flow-cut gaps and hardness of directed cut problems (JC, SK), pp. 179–188.
- STOC-2007-GuhaM #algorithm #approximate #learning
- Approximation algorithms for budgeted learning problems (SG, KM), pp. 104–113.
- STOC-2007-HavivR #polynomial
- Tensor-based hardness of the shortest vector problem to within almost polynomial factors (IH, OR), pp. 469–477.
- CAV-2007-BruttomessoCFGHNPS #industrial #lazy evaluation #smt #verification
- A Lazy and Layered SMT(BV) Solver for Hard Industrial Verification Problems (RB, AC, AF, AG, ZH, AN, AP, RS), pp. 547–560.
- CSL-2007-RabinovichT #logic
- Logical Refinements of Church’s Problem (AR, WT), pp. 69–83.
- LICS-2007-EgriLT #constraints #datalog #symmetry
- Symmetric Datalog and Constraint Satisfaction Problems in Logspace (LE, BL, PT), pp. 193–202.
- LICS-2007-Hales #geometry
- Some Methods of Problem Solving in Elementary Geometry (TCH), pp. 35–40.
- SAT-2007-LukasiewyczGHT #multi #pseudo
- Solving Multi-objective Pseudo-Boolean Problems (ML, MG, CH, JT), pp. 56–69.
- SAT-2007-MakinoTY #on the
- On the Boolean Connectivity Problem for Horn Relations (KM, ST, MY), pp. 187–200.
- SAT-2007-PerezV #effectiveness #encoding #logic
- Encodings of Problems in Effectively Propositional Logic (JANP, AV), p. 3.
- SAT-2007-PorschenS #algorithm #satisfiability
- Algorithms for Variable-Weighted 2-SAT and Dual Problems (SP, ES), pp. 173–186.
- TestCom-FATES-2007-NeukirchenB #detection #quality #smell #testing
- Utilising Code Smells to Detect Quality Problems in TTCN-3 Test Suites (HN, MB), pp. 228–243.
- QoSA-2006-Bosch #product line
- Expanding the Scope of Software Product Families: Problems and Alternative Approaches (JB), p. 1.
- DocEng-2006-HurstMA #layout
- Solving the simple continuous table layout problem (NH, KM, DWA), pp. 28–30.
- DRR-2006-BentleyM #challenge #string
- CAPTCHA challenge strings: problems and improvements (JLB, CLM).
- ECDL-2006-Tolosana-CalasanzALNMZ #identification #metadata #on the #quality
- On the Problem of Identifying the Quality of Geographic Metadata (RTC, JAÁR, JL, JNI, PRMM, FJZS), pp. 232–243.
- JCDL-2006-CampbellTL #network
- The NDIIPP preservation network: progress, problems, and promise (LEC, HRT, PL), p. 189.
- JCDL-2006-OnELKP #approach #clique #effectiveness #library #using
- An effective approach to entity resolution problem using quasi-clique and its application to digital libraries (BWO, EE, DL, JK, JP), pp. 51–52.
- PODS-2006-CondonDHW #algorithm #pipes and filters
- Flow algorithms for two pipelined filter ordering problems (AC, AD, LH, NW), pp. 193–202.
- PODS-2006-JayramKV #query
- The containment problem for REAL conjunctive queries with inequalities (TSJ, PGK, EV), pp. 80–89.
- SIGMOD-2006-DuanB #identification #performance
- Proactive identification of performance problems (SD, SB), pp. 766–768.
- CSEET-2006-WallaceWB #analysis
- Instruction in Problem Structuring and Analysis Through Problem Frames (CW, XW, VB), pp. 185–186.
- ITiCSE-2006-BirdC #learning
- Building a search engine to drive problem-based learning (SB, JRC), pp. 153–157.
- ITiCSE-2006-ChenWHL #algorithm #benchmark #design #metric
- Design and applications of an algorithm benchmark system in a computational problem solving environment (MYC, JDW, JHH, DTL), pp. 123–127.
- ITiCSE-2006-OKellyG #approach #education #learning #programming
- RoboCode & problem-based learning: a non-prescriptive approach to teaching programming (JO, JPG), pp. 217–221.
- ITiCSE-2006-SchreyerW #automaton #finite #modelling
- Finite automata models for CS problem with binary semaphore (BS, WW), p. 330.
- ITiCSE-2006-Utting #education #java #programming #using
- Problems in the initial teaching of programming using Java: the case for replacing J2SE with J2ME (IU), pp. 193–196.
- CSMR-2006-Kajko-Mattsson #evaluation #industrial
- Evaluation of CM
^{3}: Front-End Problem Management within Industry (MKM), pp. 367–368. - ICSM-2006-BakerHSS #component
- Search Based Approaches to Component Selection and Prioritization for the Next Release Problem (PB, MH, KS, AS), pp. 176–185.
- ICSM-2006-BakotaFGRX #maintenance #modelling #towards
- Towards Portable Metrics-based Models for Software Maintenance Problems (TB, RF, TG, CR, JX), pp. 483–486.
- DLT-J-2005-AfoninH06 #regular expression #set
- Membership and Finiteness Problems for Rational Sets of Regular Languages (SA, EH), pp. 493–506.
- ICALP-v1-2006-AlonSS #approximate
- Additive Approximation for Edge-Deletion Problems (NA, AS, BS), pp. 1–2.
- ICALP-v1-2006-ChenD #2d #complexity #fixpoint #on the
- On the Complexity of 2D Discrete Fixed Point Problem (XC, XD), pp. 489–500.
- ICALP-v1-2006-EpsteinL #robust
- A Robust APTAS for the Classical Bin Packing Problem (LE, AL), pp. 214–225.
- ICALP-v1-2006-Harren #approximate #orthogonal
- Approximating the Orthogonal Knapsack Problem for Hypercubes (RH), pp. 238–249.
- ICALP-v1-2006-HoangMT #on the
- On the Bipartite Unique Perfect Matching Problem (TMH, MM, TT), pp. 453–464.
- ICALP-v1-2006-KortsarzN #algorithm #approximate
- Tight Approximation Algorithm for Connectivity Augmentation Problems (GK, ZN), pp. 443–452.
- ICALP-v1-2006-Marx #optimisation
- A Parameterized View on Matroid Optimization Problems (DM), pp. 655–666.
- ICALP-v1-2006-VassilevskaWY #graph
- Finding the Smallest H-Subgraph in Real Weighted Graphs and Related Problems (VV, RW, RY), pp. 262–273.
- ICALP-v2-2006-Jurdzinski #complexity #on the #safety
- On Complexity of Grammars Related to the Safety Problem (TJ), pp. 432–443.
- ICALP-v2-2006-KariantoKT #on the #set
- On Intersection Problems for Polynomially Generated Sets (KW, AK, WT), pp. 516–527.
- FM-2006-Boute #formal method #independence #using
- Using Domain-Independent Problems for Introducing Formal Methods (RTB), pp. 316–331.
- ICFP-2006-Rosu #similarity
- Equality of streams is a Pi0 over 2-complete problem (GR), pp. 184–191.
- CIG-2006-MittalD #multi
- Optimal Strategies of the Iterated Prisoner's Dilemma Problem for Multiple Conflicting Objectives (SM, KD), pp. 197–204.
- CIG-2006-ReynoldsAA #algorithm #game studies #optimisation #using
- Optimization Problem Solving using Predator/Prey Games and Cultural Algorithms (RGR, MZA, RSA), pp. 119–125.
- CHI-2006-BergmanBN #information management
- The project fragmentation problem in personal information management (OB, RBM, RN), pp. 271–274.
- CSCW-2006-KoschmannLGF
- The mystery of the missing referent: objects, procedures, and the problem of the instruction follower (TK, CL, CG, PJF), pp. 373–382.
- ICEIS-ISAS-2006-GoeppK #information management #question #requirements
- Key-Problem and Goal Driven Requirements Engineering — Which Complementarities for Manufacturing Information Systems? (VG, FK), pp. 102–109.
- ECIR-2006-UrbanJ #image #query #question #retrieval
- Can a Workspace Help to Overcome the Query Formulation Problem in Image Retrieval? (JU, JMJ), pp. 385–396.
- ICML-2006-ConitzerG #algorithm #learning #online
- Learning algorithms for online principal-agent problems (and selling goods online) (VC, NG), pp. 209–216.
- ICML-2006-DegrisSW #learning #markov #process
- Learning the structure of Factored Markov Decision Processes in reinforcement learning problems (TD, OS, PHW), pp. 257–264.
- ICML-2006-GreeneC #clustering #documentation #kernel
- Practical solutions to the problem of diagonal dominance in kernel document clustering (DG, PC), pp. 377–384.
- ICML-2006-StrehlMLH #learning
- Experience-efficient learning in associative bandit problems (ALS, CM, MLL, HH), pp. 889–896.
- ICPR-v2-2006-CourteilleDM #using
- A Global Solution to the SFS Problem Using B-spline Surface and Simulated Annealing (FC, JDD, GM), pp. 332–335.
- ICPR-v2-2006-ZhengL #analysis #component #kernel #learning #locality
- Regularized Locality Preserving Learning of Pre-Image Problem in Kernel Principal Component Analysis (WSZ, JHL), pp. 456–459.
- ICPR-v2-2006-ZhengLY #kernel #learning
- Weakly Supervised Learning on Pre-image Problem in Kernel Methods (WSZ, JHL, PCY), pp. 711–715.
- ICPR-v2-2006-ZhengYYW #classification #effectiveness #image
- Effective classification image space which can solve small sample size problem (YJZ, JYY, JY, XW), pp. 861–864.
- ICPR-v3-2006-CharoentamPJ #image #multi #robust
- A Robust Region-Based Multiscale Image Fusion Scheme for Mis-Registration Problem of Thermal and Visible Images (OC, VP, SJ), pp. 669–672.
- ICPR-v3-2006-ChengC
- A Complementary Ordering Method for Class Imbalanced Problem (HTC, CSC), pp. 429–432.
- ICPR-v3-2006-SagheerTTAM #approach #feature model #multi #performance
- Fast Feature Extraction Approach for Multi-Dimension Feature Space Problems (AES, NT, RiT, DA, SM), pp. 417–420.
- ICPR-v4-2006-ChaoTWC #framework #kernel #testing #verification
- A Kernel-based Discrimination Framework for Solving Hypothesis Testing Problems with Application to Speaker Verification (YHC, WHT, HMW, RCC), pp. 229–232.
- ICPR-v4-2006-HocquetRC #estimation #parametricity
- Estimation of User Specific Parameters in One-class Problems (SH, JYR, HC), pp. 449–452.
- KDD-2006-Kahn #statistics
- Capital One’s statistical problems: our top ten list (WK), p. 834.
- KDD-2006-TongF #performance
- Center-piece subgraphs: problem definition and fast solutions (HT, CF), pp. 404–413.
- SEKE-2006-LehmanW #convergence #rule-based #simulation
- A Rule-Based Expert System for the Diagnosis of Convergence Problems in Circuit Simulation (CWL, MJW), pp. 57–60.
- SEKE-2006-TamzalitSO #architecture #component #evolution
- Evolution problem within Component-Based Software Architecture (DT, NS, MO), pp. 296–301.
- PADL-2006-QuesadaRDC #using
- Using Dominators for Solving Constrained Path Problems (LQ, PVR, YD, RC), pp. 73–87.
- RE-2006-LiuJ #analysis #requirements
- Integrating Goals and Problem Frames in Requirements Analysis (LL, ZJ), pp. 342–343.
- RE-2006-RegevGW
- Creativity and the Age-Old Resistance to Change Problem in RE (GR, DCG, AW), pp. 284–291.
- RE-2006-SeaterJ
- Requirement Progression in Problem Frames Applied to a Proton Therapy System (RS, DJ), pp. 166–175.
- ICSE-2006-Abrial #formal method #industrial
- Formal methods in industry: achievements, problems, future (JRA), pp. 761–768.
- ICSE-2006-YamauchiWIV #development
- The problem of knowledge decoupling in software development projects (YY, JW, NI, EV), pp. 877–880.
- SAC-2006-AltLM #linear #on the #probability #using
- On the numerical solution to linear problems using stochastic arithmetic (RA, JLL, SM), pp. 1635–1639.
- SAC-2006-DantsinWK #algorithm #constraints #quantum #towards
- Quantum versions of k-CSP algorithms: a first step towards quantum algorithms for interval-related constraint satisfaction problems (ED, AW, VK), pp. 1640–1644.
- SAC-2006-LeongL #algorithm #multi
- A multi-agent algorithm for vehicle routing problem with time window (HWL, ML), pp. 106–111.
- SAC-2006-Oltean #multi #named
- A-Brain: the multiple problems solver (MO), pp. 955–959.
- SAC-2006-PavonDL #constraints #geometry #theorem proving
- An adjustment model in a geometric constraint solving problem (RP, FD, MVL), pp. 968–973.
- SAC-2006-SinghXMH #geometry #linear #locality #programming #using
- Solving the brachytherapy seed localization problem using geometric and linear programming techniques (VS, LM, JX, KRH), pp. 229–234.
- SAC-2006-WintzSM #constraints #framework #geometry
- A framework for geometric constraint satisfaction problem (JW, PS, PM), pp. 974–978.
- CASE-2006-CapachoPGD #assembly #heuristic
- Heuristic Methods to Solve the Alternative Subgraphs Assembly Line Balancing Problem (LC, RP, OG, AD), pp. 501–506.
- CASE-2006-ChandrasekaranSPV #algorithm #optimisation #permutation #scheduling
- An Application of Particle Swarm Optimization Algorithm to Permutation Flowshop Scheduling Problems to Minimize Makespan, Total Flowtime and Completion Time Variance (SC, RKS, SGP, NV), pp. 513–518.
- CASE-2006-NishiM #composition #optimisation #petri net
- Decomposition of Petri Nets for Optimization of Routing Problem for AGVs in Semiconductor Fabrication Bays (TN, RM), pp. 236–241.
- CASE-2006-PiPS #delivery
- Nested Partitions Method for the Local Pickup and Delivery Problem (LP, YP, LS), pp. 375–380.
- CASE-2006-Wen #collaboration #design #research
- A Model for Industry-University Collaborative Research: Transforming Specific Problem Solution into Broad Design Methodologies (JTW), p. 1.
- CC-2006-XueK #fresh look
- A Fresh Look at PRE as a Maximum Flow Problem (JX, JK), pp. 139–154.
- HPDC-2006-DjerrahCCR #bound #framework #optimisation
- Bob++: Framework for Solving Optimization Problems with Branch-and-Bound methods (AD, BLC, VDC, CR), pp. 369–370.
- PDP-2006-Baz #parallel #programming
- Load Balancing in a Parallel Dynamic Programming Multi-Method Applied to the 0-1 Knapsack Problem (ME, DEB), pp. 127–132.
- PDP-2006-CzechW #optimisation #parallel
- Solving Bicriterion Optimization Problems by Parallel Simulated Annealing (ZJC, BW), pp. 7–14.
- FASE-2006-Ghezzi #re-engineering
- Software Engineering: Emerging Goals and Lasting Problems (CG), p. 2.
- FASE-2006-LavazzaB #requirements #uml
- Combining Problem Frames and UML in the Description of Software Requirements (LL, VDB), pp. 199–213.
- STOC-2006-AchlioptasR #constraints #geometry #on the #random
- On the solution-space geometry of random constraint satisfaction problems (DA, FRT), pp. 130–139.
- STOC-2006-AndrewsZ
- Logarithmic hardness of the directed congestion minimization problem (MA, LZ), pp. 517–526.
- STOC-2006-BansalS
- The Santa Claus problem (NB, MS), pp. 31–40.
- STOC-2006-BeimelCNW #approximate
- Private approximation of search problems (AB, PC, KN, EW), pp. 119–128.
- STOC-2006-ChuzhoyK #graph
- Hardness of cut problems in directed graphs (JC, SK), pp. 527–536.
- STOC-2006-DevanurKSV #linear
- Integrality gaps for sparsest cut and minimum linear arrangement problems (NRD, SK, RS, NKV), pp. 537–546.
- STOC-2006-GoldbergP #equilibrium
- Reducibility among equilibrium problems (PWG, CHP), pp. 61–70.
- STOC-2006-RegevR
- Lattice problems and norm embeddings (OR, RR), pp. 447–456.
- STOC-2006-ReingoldTV #graph #pseudo
- Pseudorandom walks on regular digraphs and the RL vs. L problem (OR, LT, SPV), pp. 457–466.
- CSL-2006-HellaT #higher-order #logic
- Complete Problems for Higher Order Logics (LH, JMTT), pp. 380–394.
- CSL-2006-Rabinovich #parametricity #synthesis
- Church Synthesis Problem with Parameters (AMR), pp. 546–561.
- FATES-RV-2006-KrichenT #finite #identification #transducer
- State-Identification Problems for Finite-State Transducers (MK, ST), pp. 148–162.
- ICLP-2006-Brain #declarative #semantics #set #using
- Declarative Problem Solving Using Answer Set Semantics (MB), pp. 459–460.
- LICS-2006-DawarGKS #approximate #first-order #optimisation
- Approximation Schemes for First-Order Definable Optimisation Problems (AD, MG, SK, NS), pp. 411–420.
- LICS-2006-LaroseLT #constraints #first-order
- A Characterisation of First-Order Constraint Satisfaction Problems (BL, CL, CT), pp. 201–210.
- LICS-2006-Otto #bound #first-order #logic #monad
- The Boundedness Problem for Monadic Universal First-Order Logic (MO), pp. 37–48.
- SAT-2006-ChenIJSS #constraints #theorem
- A Dichotomy Theorem for Typed Constraint Satisfaction Problems (SC, TI, KJ, DS, MS), pp. 226–239.
- SAT-2006-FuM #on the #satisfiability
- On Solving the Partial MAX-SAT Problem (ZF, SM), pp. 252–265.
- SAT-2006-NieuwenhuisO #modulo theories #on the #optimisation #satisfiability
- On SAT Modulo Theories and Optimization Problems (RN, AO), pp. 156–169.
- SAT-2006-WatanabeY #analysis #satisfiability
- Average-Case Analysis for the MAX-2SAT Problem (OW, MY), pp. 277–282.
- TestCom-2006-ChenU #detection #distributed #testing
- Detecting Observability Problems in Distributed Testing (JC, HU), pp. 213–226.
- WICSA-2005-CapillaD #component #integration #product line #web
- Integration Problems of Core Components in a Web Product Line (RC, JCD), pp. 215–216.
- HT-2005-Moulthrop #hypermedia #what
- What the geeks know: hypertext and the problem of literacy (SM), pp. 227–231.
- JCDL-2005-JuangWLHCH #library
- Resolving the unencoded character problem for chinese digital libraries (DJ, JHW, CYL, CCH, LFC, JMH), pp. 311–319.
- JCDL-2005-OnLKM #ambiguity #case study #comparative #framework #scalability #using
- Comparative study of name disambiguation problem using a scalable blocking-based framework (BWO, DL, JK, PM), pp. 344–353.
- CSEET-2005-ArmaregoC #design #education
- Problem-based Design Studios for Undergraduate SE Education (JA, SC), pp. 254–256.
- ITiCSE-2005-MullerH #algorithm #guidelines #multi #object-oriented
- Guidelines for a multiple-goal CS introductory course: algorithmic problem-solving woven into OOP (OM, BH), p. 356.
- SIGITE-2005-DeFranco-TommarelloD #collaboration #development #online #tutorial
- An on-line tutorial for collaborative problem solving and software development (JDT, FPD), pp. 349–352.
- IWPC-2005-KirkRW #framework #identification #reuse
- Identifying and Addressing Problems in Framework Reuse (DK, MR, MW), pp. 77–86.
- WCRE-2005-TrifuM #design #object-oriented
- Diagnosing Design Problems in Object Oriented Systems (AT, RM), pp. 155–164.
- CIAA-J-2004-BordihnHK05 #context-free grammar #subclass
- Unsolvability levels of operation problems for subclasses of context-free languages (HB, MH, MK), pp. 423–440.
- DLT-J-2004-DassowH05 #product line
- Language families defined by a ciliate bio-operation: hierarchies and decision problems (JD, MH), pp. 645–662.
- CIAA-2005-PodlovchenkoRZ #equivalence #on the #source code
- On the Equivalence Problem for Programs with Mode Switching (RIP, DMR, VAZ), pp. 351–352.
- DLT-2005-AfoninH #regular expression #set
- Membership and Finiteness Problems for Rational Sets of Regular Languages (SA, EH), pp. 88–99.
- DLT-2005-Massazza #ambiguity
- The Inclusion Problem for Unambiguous Rational Trace Languages (PM), pp. 350–361.
- ICALP-2005-BilleG #performance
- The Tree Inclusion Problem: In Optimal Space and Faster (PB, ILG), pp. 66–77.
- ICALP-2005-ChlebusGKR #network #on the
- On the Wake-Up Problem in Radio Networks (BSC, LG, DRK, TR), pp. 347–359.
- ICALP-2005-JainHT #concurrent
- The Generalized Deadlock Resolution Problem (KJ, MTH, KT), pp. 853–865.
- ICALP-2005-Karakostas #approximate
- A Better Approximation Ratio for the Vertex Cover Problem (GK), pp. 1043–1050.
- ICALP-2005-KoiranNP #bound #complexity #quantum #query
- A Quantum Lower Bound for the Query Complexity of Simon’s Problem (PK, VN, NP), pp. 1287–1298.
- ICALP-2005-KonemannLSZ
- From Primal-Dual to Cost Shares and Back: A Stronger LP Relaxation for the Steiner Forest Problem (JK, SL, GS, SHMvZ), pp. 930–942.
- ICALP-2005-KumarSS #algorithm #clustering #linear
- Linear Time Algorithms for Clustering Problems in Any Dimensions (AK, YS, SS), pp. 1374–1385.
- ICALP-2005-LiDIY #verification
- Signaling P Systems and Verification Problems (CL, ZD, OHI, HCY), pp. 1462–1473.
- ICALP-2005-PemmarajuR #algorithm #approximate
- Approximation Algorithms for the Max-coloring Problem (SVP, RR), pp. 1064–1075.
- ICALP-2005-RadhakrishnanRS #fourier #on the #power of #random
- On the Power of Random Bases in Fourier Sampling: Hidden Subgroup Problem in the Heisenberg Group (JR, MR, PS), pp. 1399–1411.
- CIG-2005-JinT
- Co-evolutionary Strategies for an Alternating-Offer Bargaining Problem (NJ, EPKT).
- CIG-2005-KishimotoM #approach #composition #divide and conquer
- Dynamic Decomposition Search: A Divide and Conquer Approach and its Application to the One-Eye Problem in Go (AK, MM0).
- DiGRA-2005-Smith #collaboration
- The problem of other players - in-game collaboration as collective action (JHS).
- CHI-2005-BlackmonKP #effectiveness #navigation #predict
- Tool for accurately predicting website navigation problems, non-problems, problem severity, and effectiveness of repairs (MHB, MK, PGP), pp. 31–40.
- CHI-2005-HornbaekF #development #usability
- Comparing usability problems and redesign proposals as input to practical systems development (KH, EF), pp. 391–400.
- ICEIS-v1-2005-HammerschmidtKL #xml
- The Index Update Problem for XML Data in XDBMS (BCH, MK, VL), pp. 27–34.
- ICEIS-v2-2005-CuellarDJ #network #predict #programming
- An Application of Non-Linear Programming to Train Recurrent Neural Networks in Time Series Prediction Problems (MPC, MD, MdCPJ), pp. 35–42.
- ICEIS-v2-2005-Hakansson #comprehension
- Transferring Problem Solving Strategies from the Expert to the End Users — Supporting Understanding (AH), pp. 3–10.
- ICEIS-v3-2005-TanL #enterprise #framework #modelling #simulation #using
- Enterprise Infrastructure Planning — Modelling and Simulation Using the Problem Articulation Method (ST, KL), pp. 240–245.
- ICML-2005-HillD #adaptation #classification
- Adapting two-class support vector classification methods to many class problems (SIH, AD), pp. 313–320.
- ICML-2005-ScholkopfSB #machine learning
- Object correspondence as a machine learning problem (BS, FS, VB), pp. 776–783.
- ICML-2005-TsangKL #scalability
- Core Vector Regression for very large regression problems (IWT, JTK, KTL), pp. 912–919.
- ICML-2005-WalderCS #modelling
- Implicit surface modelling as an eigenvalue problem (CW, OC, BS), pp. 936–939.
- KDD-2005-FujimakiYM #approach #detection #kernel #using
- An approach to spacecraft anomaly detection problem using kernel feature space (RF, TY, KM), pp. 401–410.
- SIGIR-2005-BlancoB #documentation #identifier
- Characterization of a simple case of the reassignment of document identifiers as a pattern sequencing problem (RB, AB), pp. 587–588.
- MoDELS-2005-MiliE #design pattern #question #representation #what
- Representing and Applying Design Patterns: What Is the Problem? (HM, GEB), pp. 186–200.
- MoDELS-2005-MiliE #design pattern #question #representation #what
- Representing and Applying Design Patterns: What Is the Problem? (HM, GEB), pp. 186–200.
- ECOOP-2005-Meyer #object-oriented #programming
- Attached Types and Their Application to Three Open Problems of Object-Oriented Programming (BM), pp. 1–32.
- PADL-2005-Munoz-HernandezG #collaboration #fuzzy
- Solving Collaborative Fuzzy Agents Problems with CLP(FD) (SMH, JMGP), pp. 187–202.
- POPL-2005-FosterGMPS #approach #combinator #program transformation
- Combinators for bi-directional tree transformations: a linguistic approach to the view update problem (JNF, MBG, JTM, BCP, AS), pp. 233–246.
- SAS-2005-TerauchiA #data flow #safety
- Secure Information Flow as a Safety Problem (TT, AA), pp. 352–367.
- RE-2005-ArkleyR #traceability
- Overcoming the Traceability Benefit Problem (PA, SR), pp. 385–389.
- GTTSE-2005-PorkolabZ #c++ #composition #metaprogramming
- A Feature Composition Problem and a Solution Based on C++ Template Metaprogramming (ZP, IZ), pp. 459–470.
- ICSE-2005-Olalekan #empirical #re-engineering #research
- Conducting empirical software engineering research in Nigeria: the posing problems (ASO), pp. 633–634.
- SAC-2005-ChabertTN #consistency #constraints
- Box-set consistency for interval-based constraint problems (GC, GT, BN), pp. 1439–1443.
- SAC-2005-GuoLLW #linear
- The shortest route cut and fill problem in linear topological structure (SG, WL, AL, FW), pp. 409–410.
- SAC-2005-LauW #approach #multi #optimisation
- A multi-agent approach for solving optimization problems involving expensive resources (HCL, HW), pp. 79–83.
- SAC-2005-LimZ
- The container loading problem (AL, XZ), pp. 913–917.
- SAC-2005-LimZLR #graph #heuristic
- Heuristic methods for graph coloring problems (AL, YZ, QL, BR), pp. 933–939.
- SAC-2005-OConnellOF #constraints
- Timid acquisition of constraint satisfaction problems (SO, BO, ECF), pp. 404–408.
- SAC-2005-SpohnG #network #set #using
- A solution for the location problem in arbitrary computer networks using generic dominating sets (MAS, JJGLA), pp. 739–743.
- SAC-2005-XiaoLJ #clustering #on the #scheduling
- On unit task linear-nonlinear two-cluster scheduling problem (ZX, WNL, JJFJ), pp. 713–717.
- CASE-2005-ChiangF #scheduling
- An iterative refining mechanism for general job shop scheduling problems (TCC, LCF), pp. 203–208.
- CASE-2005-PanSY #approach #optimisation
- A new optimization approach to the general single machine earliness-tardiness problem (YP, LS, HY), pp. 43–48.
- CASE-2005-TangK #distributed #game studies #modelling #multi
- Cooperation in a multi-stage game for modeling distributed task delegation in a supply chain procurement problem (KT, SRTK), pp. 93–98.
- CASE-2005-TanonkouBBX #approach #probability #using
- Solving a stochastic inventory-location problem using Lagrangian relaxation approach (GAT, LB, RB, XX), pp. 279–284.
- DAC-2005-LiSB #bound #effectiveness
- Effective bounding techniques for solving unate and binate covering problems (XYL, MFMS, FB), pp. 385–390.
- HPCA-2005-MukherjeeER #architecture #fault #perspective
- The Soft Error Problem: An Architectural Perspective (SSM, JSE, SKR), pp. 243–247.
- FASE-2005-CaneteM #ontology #re-engineering #towards
- Towards a Theory on the Role of Ontologies in Software Engineering Problem Solving (JMC, FJGM), pp. 205–219.
- STOC-2005-AgarwalCMM #algorithm #approximate
- O(sqrt(log n)) approximation algorithms for min UnCut, min 2CNF deletion, and directed cut problems (AA, MC, KM, YM), pp. 573–581.
- STOC-2005-AndrewsZ
- Hardness of the undirected edge-disjoint paths problem (MA, LZ), pp. 276–283.
- STOC-2005-AndrewsZ05a
- Hardness of the undirected congestion minimization problem (MA, LZ), pp. 284–293.
- STOC-2005-ChekuriKS #multi
- Multicommodity flow, well-linked terminals, and routing problems (CC, SK, FBS), pp. 183–192.
- STOC-2005-FlaxmanFV #algorithm #approximate #on the #performance
- On the average case performance of some greedy approximation algorithms for the uncapacitated facility location problem (AF, AMF, JCV), pp. 441–449.
- STOC-2005-Garg #approximate #graph
- Saving an epsilon: a 2-approximation for the k-MST problem in graphs (NG), pp. 396–402.
- STOC-2005-VegaKKV #approximate #composition #constraints
- Tensor decomposition and approximation schemes for constraint satisfaction problems (WFdlV, MK, RK, SV), pp. 747–754.
- SAT-J-2004-AnsoteguiM05
- Mapping Problems with Finite-Domain Variables to Problems with Boolean Variables (CA, FM), pp. 1–15.
- SAT-J-2004-PorschenS05 #bound
- Worst Case Bounds for Some NP-Complete Modified Horn-SAT Problems (SP, ES), pp. 251–262.
- SAT-J-2004-TangYRM05 #algorithm #analysis #quantifier #satisfiability
- Analysis of Search Based Algorithms for Satisfiability of Propositional and Quantified Boolean Formulas Arising from Circuit State Space Diameter Problems (DT, YY, DR, SM), pp. 292–305.
- ICLP-2005-DovierFP #comparison
- A Comparison of CLP(FD) and ASP Solutions to NP-Complete Problems (AD, AF, EP), pp. 67–82.
- LICS-2005-Atserias #on the
- On Digraph Coloring Problems and Treewidth Duality (AA), pp. 106–115.
- SAT-2005-ArgelichM #satisfiability
- Solving Over-Constrained Problems with SAT Technology (JA, FM), pp. 1–15.
- SAT-2005-MeierS #algebra #benchmark #metric #satisfiability #set
- A New Set of Algebraic Benchmark Problems for SAT Solvers (AM, VS), pp. 459–466.
- TestCom-2005-KrichenT #automaton #identification
- State Identification Problems for Timed Automata (MK, ST), pp. 175–191.
- CBSE-2004-MinCK #component #off the shelf #using
- Using Smart Connectors to Resolve Partial Matching Problems in COTS Component Acquisition (HGM, SWC, SDK), pp. 40–47.
- ECDL-2004-HongOL #approach #library
- System Support for Name Authority Control Problem in Digital Libraries: OpenDBLP Approach (YH, BWO, DL), pp. 134–144.
- ECDL-2004-Rydberg-CoxVRH #information retrieval #multi #visualisation
- Approaching the Problem of Multi-lingual Information Retrieval and Visualization in Greek and Latin and Old Norse Texts (JARC, LV, SMR, DH), pp. 168–178.
- PODS-2004-HershbergerS #adaptation #data type #geometry
- Adaptive Sampling for Geometric Problems over Data Streams (JH, SS), pp. 252–262.
- VLDB-2004-BraganholoDH #relational #xml
- From XML View Updates to Relational View Updates: old solutions to a new problem (VPB, SBD, CAH), pp. 276–287.
- ITiCSE-2004-AlfonsiSPS #named
- IT4PS: information technology for problem solving (CRA, NS, DP, MS), p. 241.
- ITiCSE-2004-Gal-EzerLS
- Interesting basic problems for CS1 (JGE, DL, DS), p. 275.
- ITiCSE-2004-MintonBD #case study
- If diversity is a problem could e-learning be part of the solution?: a case study (LM, RDB, VD), pp. 42–46.
- ITiCSE-2004-MullerHA
- (An almost) pedagogical pattern for pattern-based problem-solving instruction (OM, BH, HA), pp. 102–106.
- ITiCSE-2004-PaciniFF #database #learning #spreadsheet #tool support
- Learning problem solving with spreadsheet and database tools (GP, GF, AF), p. 267.
- ITiCSE-WGR-2004-CinneideT #approach #design pattern #education
- A problem-based approach to teaching design patterns (MÓC, RT), pp. 80–82.
- ITiCSE-WGR-2004-RolfeP #backtracking #bound
- An alternative problem for backtracking and bounding (TJR, PWP), pp. 83–84.
- SIGITE-2004-LawareW
- Real world problems bringing life to course content (GWL, AJW), pp. 6–12.
- ICSM-2004-Gustavsson #evolution #process #runtime
- Strategies for Handling the Activity Problem in Runtime Software Evolution by Reducing Activity (JG), p. 525.
- CIAA-2004-BordihnHK #context-free grammar #linear
- Some Non-semi-decidability Problems for Linear and Deterministic Context-Free Languages (HB, MH, MK), pp. 68–79.
- CIAA-2004-ZakharovZ #automaton #multi #on the #source code
- On the Equivalence-Checking Problem for a Model of Programs Related with Multi-tape Automata (VAZ, IZ), pp. 293–305.
- DLT-2004-GruskaTP #array #communication
- Optimal Time and Communication Solutions of Firing Squad Synchronization Problems on Square Arrays, Toruses and Rings (JG, SLT, MP), pp. 200–211.
- DLT-2004-LakinT
- Context-Sensitive Decision Problems in Groups (SRL, RMT), pp. 296–307.
- DLT-2004-Potapov #automaton #matrix #multi #reachability
- From Post Systems to the Reachability Problems for Matrix Semigroups and Multicounter Automata (IP), pp. 345–356.
- DLT-2004-Reidenbach #equivalence #on the #pattern matching
- On the Equivalence Problem for E-pattern Languages over Small Alphabets (DR), pp. 368–380.
- ICALP-2004-DurrHHM #complexity #graph #quantum #query
- Quantum Query Complexity of Some Graph Problems (CD, MH, PH, MM), pp. 481–493.
- ICALP-2004-DvorakKP #consistency #constraints
- Locally Consistent Constraint Satisfaction Problems: (ZD, DK, OP), pp. 469–480.
- ICALP-2004-FeigenbaumKMSZ #graph #on the
- On Graph Problems in a Semi-streaming Model (JF, SK, AM, SS, JZ), pp. 531–543.
- ICALP-2004-HalperinK #set
- The Minimum-Entropy Set Cover Problem (EH, RMK), pp. 733–744.
- ICALP-2004-HeeringaA #design
- Optimal Website Design with the Constrained Subtree Selection Problem (BH, MA), pp. 757–769.
- ICALP-2004-IndykLLP
- Closest Pair Problems in Very High Dimensions (PI, ML, OL, EP), pp. 782–792.
- ICALP-2004-JothiR #algorithm #approximate #design #network
- Approximation Algorithms for the Capacitated Minimum Spanning Tree Problem and Its Variants in Network Design (RJ, BR), pp. 805–818.
- ICALP-2004-Lohrey #word
- Word Problems on Compressed Words (ML), pp. 906–918.
- ICALP-2004-Midrijanis #bound #polynomial #quantum #query #set #similarity
- A Polynomial Quantum Query Lower Bound for the Set Equality Problem (GM), pp. 996–1005.
- ICALP-2004-SahinalpU #similarity #string
- Hardness of String Similarity Search and Other Indexing Problems (SCS, AU), pp. 1080–1098.
- RTA-2004-MitsuhashiOOY #confluence #unification
- The Joinability and Unification Problems for Confluent Semi-constructor TRSs (IM, MO, YO, TY), pp. 285–300.
- SFM-2004-AlurM #automaton #overview
- Decision Problems for Timed Automata: A Survey (RA, PM), pp. 1–24.
- ICEIS-v2-2004-EnnigrouG #approach #flexibility #multi #scheduling
- Multi-Agent Approach Based on Tabu Search for the Flexible Job Shop Scheduling Problem (ME, KG), pp. 22–28.
- ICEIS-v2-2004-VeskiojaV
- Majority Voting in Stable Marriage Problem with Couples (TV, LV), pp. 442–447.
- ICEIS-v3-2004-CastelaT #modelling
- As Is Organizational Modeling: The Problem of Its Dynamic Management (NC, JMT), pp. 561–564.
- ICEIS-v3-2004-CheungHY
- The Delegation Problem and Practical PKI-Based Solutions (VLSC, LCKH, SMY), pp. 73–84.
- ICEIS-v4-2004-LeDG #multi #on the #ontology #semantics #web
- On Ontology Matching Problems — for Building a Corporate Semantic Web in a Multi-Communities Organization (BTL, RDK, FG), pp. 236–243.
- CIKM-2004-AndrusBST
- Key problems in integrating structured and unstructured information (DCA, DB, JTS, ET), p. 360.
- ICML-2004-AppiceCRF #multi
- Redundant feature elimination for multi-class problems (AA, MC, SR, PAF).
- ICML-2004-FernB #clustering #graph
- Solving cluster ensemble problems by bipartite graph partitioning (XZF, CEB).
- ICML-2004-FrankK #multi
- Ensembles of nested dichotomies for multi-class problems (EF, SK).
- ICML-2004-KoppelS #classification #verification
- Authorship verification as a one-class classification problem (MK, JS).
- ICML-2004-Zhang #algorithm #linear #predict #probability #scalability #using
- Solving large scale linear prediction problems using stochastic gradient descent algorithms (TZ0).
- ICPR-v1-2004-DuinPT #classification
- The Characterization of Classification Problems by Classifier Disagreements (RPWD, EP, DMJT), pp. 140–143.
- ICPR-v1-2004-MottlDK #algorithm #pattern matching #pattern recognition #recognition
- Pattern Recognition in Interrelated Data: The Problem, Fundamental Assumptions, Recognition Algorithms (VM, SD, AK), pp. 188–191.
- ICPR-v2-2004-RayBP #algorithm #search-based
- New Operators of Genetic Algorithms for Traveling Salesman Problem (SSR, SB, SKP), pp. 497–500.
- ICPR-v3-2004-KoKB04a #learning #multi
- Improved N-Division Output Coding for Multiclass Learning Problems (JK, EK, HB), pp. 470–473.
- ICPR-v3-2004-TwiningMT #approach #image
- A Unified Information-Theoretic Approach to the Correspondence Problem in Image Registration (CJT, SM, CJT), pp. 704–709.
- KDD-2004-EsterGJH #data mining #mining #segmentation
- A microeconomic data mining problem: customer-oriented catalog segmentation (ME, RG, WJ, ZH), pp. 557–562.
- KR-2004-GrootTH #analysis #approximate #case study #classification #towards
- Towards a Structured Analysis of Approximate Problem Solving: A Case Study in Classification (PG, AtT, FvH), pp. 399–406.
- KR-2004-ZhangZ #integer #scheduling
- An Improved Integer Local Search for Complex Scheduling Problems (WZ, XZ), pp. 692–700.
- SEKE-2004-CairoA #architecture #reuse
- The KAMET II Architecture for Problem-Solving Method Reuse (OC, JCA), pp. 435–438.
- SIGIR-2004-KazaiLV #evaluation #retrieval #xml
- The overlap problem in content-oriented XML retrieval evaluation (GK, ML, APdV), pp. 72–79.
- SPLC-2004-DeelstraSB #case study #experience #product line
- Experiences in Software Product Families: Problems and Issues During Product Derivation (SD, MS, JB), pp. 165–182.
- TOOLS-USA-2003-HamzaE04 #analysis
- Applying Analysis Patterns Through Analogy: Problems and Solutions (HSH, MEF), pp. 197–208.
- ECOOP-2004-Torgersen #revisited
- The Expression Problem Revisited (MT), pp. 123–143.
- AdaEurope-2004-Gogolla #formal method
- Benefits and Problems of Formal Methods (MG), pp. 1–15.
- RE-2004-LaneyBJN #requirements #using
- Composing Requirements Using Problem Frames (RCL, LB, MJ, BN), pp. 122–131.
- RE-2004-LinNIJ #bound #security #using
- Using Abuse Frames to Bound the Scope of Security Problems (LL, BN, DCI, MJ), pp. 354–355.
- RE-2004-RapanottiHJN #architecture #composition
- Architecture-driven Problem Decomposition (LR, JGH, MJ, BN), pp. 80–89.
- FSE-2004-Marks #exclamation #usability
- The usability problem for home appliances: engineers caused it, engineers can fix it! (JM), p. 95.
- ICSE-2004-Keenan #agile #analysis #process
- Agile Process Tailoring and probLem analYsis (APTLY) (FK), pp. 45–47.
- SAC-2004-AlbaC #fault #heuristic #hybrid #parallel
- Solving the error correcting code problem with parallel hybrid heuristics (EA, JFC), pp. 985–989.
- SAC-2004-AvinoGM #finite #reverse engineering
- Applications of finite fields to dynamical systems and reverse engineering problems (MAA, ELG, OM), pp. 191–196.
- SAC-2004-BistarelliFO #constraints #detection #modelling #using
- Modeling and detecting the cascade vulnerability problem using soft constraints (SB, SNF, BO), pp. 383–390.
- SAC-2004-BoughaciD #metaheuristic #optimisation #satisfiability #using
- Solving weighted Max-Sat optimization problems using a Taboo Scatter Search metaheuristic (DB, HD), pp. 35–36.
- SAC-2004-CaldeiraMR #algorithm #hybrid #using
- Using a hybrid Evolutionary-Taboo Algorithm to solve Job Shop Problem (JPC, FM, ACR), pp. 1446–1451.
- SAC-2004-FeltlR #algorithm #hybrid #search-based
- An improved hybrid genetic algorithm for the generalized assignment problem (HF, GRR), pp. 990–995.
- SAC-2004-JulstromA #algorithm #hybrid
- Two hybrid evolutionary algorithms for the rectilinear Steiner arborescence problem (BAJ, AA), pp. 980–984.
- SAC-2004-KatayamaHN #clique
- Solving the maximum clique problem by k-opt local search (KK, AH, HN), pp. 1021–1025.
- SAC-2004-PreinfalkM #automation #framework #scheduling
- Automatic construction of drama school timetables based on a generic evolutionary framework for allocation and scheduling problems (OP, HAM), pp. 996–1000.
- SAC-2004-ZumpanoGTV #on the #optimisation #power of #semantics
- On the semantics and expressive power of Datalog-like languages for NP search and optimization problems (EZ, SG, IT, PV), pp. 692–697.
- DAC-2004-AntonelliCDHKKMN #automaton #clustering #modelling
- Quantum-Dot Cellular Automata (QCA) circuit partitioning: problem modeling and solutions (DAA, DZC, TJD, XSH, ABK, PMK, RCM, MTN), pp. 363–368.
- DATE-v1-2004-CatthoorCMGLMSW #design #how #question #scalability
- How Can System-Level Design Solve the Interconnect Technology Scaling Problem? (FC, AC, GM, PG, RL, KM, PvdS, RW), pp. 332–339.
- HPDC-2004-DenisAHVKB #communication #performance #security
- Wide-Area Communication for Grids: An Integrated Solution to Connectivity, Performance and Security Problems (AD, OA, RFHH, KV, TK, HEB), pp. 97–106.
- PDP-2004-NemethGB #evaluation #performance
- Performance Evaluation on Grids: Directions, Issues and Open Problems (ZN, GG, ZB), p. 290–?.
- FoSSaCS-2004-Kirsten #automaton #distance
- Distance Desert Automata and the Star Height One Problem (DK), pp. 257–272.
- STOC-2004-BienstockI
- Solving fractional packing problems in Oast(1/?) iterations (DB, GI), pp. 146–155.
- STOC-2004-ChekuriKS #multi
- The all-or-nothing multicommodity flow problem (CC, SK, FBS), pp. 156–165.
- STOC-2004-Elkin #approximate #bound #distributed #trade-off
- Unconditional lower bounds on the time-approximation tradeoffs for the distributed minimum spanning tree problem (ME), pp. 331–340.
- STOC-2004-Indyk #algorithm #data type #geometry
- Algorithms for dynamic geometric problems over data streams (PI), pp. 373–380.
- STOC-2004-LeviRS #algorithm
- Primal-dual algorithms for deterministic inventory problems (RL, RR, DBS), pp. 353–362.
- STOC-2004-Yao #graph #quantum #sorting
- Graph entropy and quantum sorting problems (ACCY), pp. 112–117.
- TACAS-2004-KrcalY #analysis #automaton #decidability #scheduling #using
- Decidable and Undecidable Problems in Schedulability Analysis Using Timed Automata (PK, WY), pp. 236–250.
- TACAS-2004-LugiezNZ #approach #automaton #explosion #partial order #semantics
- A Partial Order Semantics Approach to the Clock Explosion Problem of Timed Automata (DL, PN, SZ), pp. 296–311.
- IJCAR-2004-BaaderGT #decidability #logic #word
- A New Combination Procedure for the Word Problem That Generalizes Fusion Decidability Results in Modal Logics (FB, SG, CT), pp. 183–197.
- IJCAR-2004-GilHSZ #algorithm #constraints #finite #order #performance
- Efficient Algorithms for Constraint Description Problems over Finite Totally Ordered Domains: Extended Abstract (ÀJG, MH, GS, BZ), pp. 244–258.
- LICS-2004-Bulatov #constraints #graph #relational
- A Graph of a Relational Structure and Constraint Satisfaction Problems (AAB), pp. 448–457.
- LICS-2004-DalmauKL #first-order #graph #reflexive
- First-Order Definable Retraction Problems for Posets and Reflexive Graph (VD, AAK, BL), pp. 232–241.
- LICS-2004-FlumG #model checking
- Model-Checking Problems as a Basis for Parameterized Intractability (JF, MG), pp. 388–397.
- LICS-2004-OuaknineW #automaton #decidability #on the
- On the Language Inclusion Problem for Timed Automata: Closing a Decidability Gap (JO, JW), pp. 54–63.
- SAT-2004-AnsoteguiM
- Mapping Problems with Finite-Domain Variables into Problems with Boolean Variables (CA, FM), pp. 111–119.
- SAT-2004-Connamacher #constraints #random
- A Random Constraint Satisfaction Problem That Seems Hard for DPLL (HSC), pp. 3–11.
- SAT-2004-TangYRM #algorithm #analysis #quantifier #satisfiability
- Analysis of Search Based Algorithms for Satisfiability of Quantified Boolean Formulas Arising from Circuit State Space Diameter Problems (DT, YY, DR, SM), pp. 214–223.
- DRR-2003-Summers #classification #documentation #image
- Document image improvment for OCR as a classification problem (KMS), pp. 73–83.
- ICDAR-2003-LeeO #classification #multi
- Binary Classification Trees for Multi-class Classification Problems (JSL, ISO), pp. 770–774.
- PODS-2003-GuptaSH #xml
- The view selection problem for XML content based routing (AKG, DS, AYH), pp. 68–77.
- SIGMOD-2003-GuptaLM #named #semantics
- BIRN-M: A Semantic Mediator for Solving Real-World Neuroscience Problems (AG, BL, MEM), p. 678.
- VLDB-2003-KornMZ #database #monitoring #network #quality
- Checks and Balances: Monitoring Data Quality Problems in Network Traffic Databases (FK, SM, YZ), pp. 536–547.
- ITiCSE-2003-EkateriniSP #education #learning
- Teaching IT in secondary education through problem-based learning could be really beneficial (GE, BS, GP), p. 243.
- ITiCSE-2003-PapamanthouP #algorithm #visualisation
- A visualization of the primal simplex algorithm for the assignment problem (CP, KP), p. 267.
- CSMR-2003-Kajko-Mattsson #maintenance
- Problems within Support (Upfront Maintenance) (MKM), pp. 331–340.
- ICSM-2003-Mitchell #approach #clustering #heuristic
- A Heuristic Approach to Solving the Software Clustering Problem (BSM), pp. 285–288.
- WCRE-2003-WalensteinJLYL #clone detection #detection
- Problems Creating Task-relevant Clone Detection Reference Data (AW, NJ, JL, YY, AL), pp. 285–295.
- CIAA-2003-MelicharP #approach #automaton #finite #sequence
- The Longest Common Subsequence Problem A Finite Automata Approach (BM, TP), pp. 294–296.
- CIAA-2003-XieLD #complexity #equation #linear #using
- New Complexity Results for Some Linear Counting Problems Using Minimal Solutions to Linear Diophantine Equations (GX, CL, ZD), pp. 163–175.
- DLT-2003-AnselmoM #formal method #perspective
- Covering Problems from a Formal Language Point of View (MA, MM), pp. 122–133.
- ICALP-2003-AgeevYZ #algorithm #approximate #combinator
- Improved Combinatorial Approximation Algorithms for the k-Level Facility Location Problem (AAA, YY, JZ), pp. 145–156.
- ICALP-2003-AroraC #approximate #strict
- Approximation Schemes for Degree-Restricted MST and Red-Blue Separation Problem (SA, KLC), pp. 176–188.
- ICALP-2003-BorosEGKM #difference #generative
- An Intersection Inequality for Discrete Distributions and Related Generation Problems (EB, KME, VG, LK, KM), pp. 543–555.
- ICALP-2003-ChenKPSX #complexity #graph
- Genus Characterizes the Complexity of Graph Problems: Some Tight Results (JC, IAK, LP, ES, GX), pp. 845–856.
- ICALP-2003-CieliebakFPS
- Solving the Robots Gathering Problem (MC, PF, GP, NS), pp. 1181–1196.
- ICALP-2003-Condon #design #predict
- Problems on RNA Secondary Structure Prediction and Design (AC), pp. 22–32.
- ICALP-2003-ElkinK #algorithm #approximate #multi
- Approximation Algorithm for Directed Telephone Multicast Problem (ME, GK), pp. 212–223.
- ICALP-2003-FialaP #complexity
- The Computational Complexity of the Role Assignment Problem (JF, DP), pp. 817–828.
- ICALP-2003-Okhotin #equation
- Decision Problems for Language Equations with Boolean Operations (AO), pp. 239–251.
- ICALP-2003-Senizergues #equivalence
- The Equivalence Problem for t-Turn DPDA Is Co-NP (GS), pp. 478–489.
- ICALP-2003-SittersSP #algorithm
- A Competitive Algorithm for the General 2-Server Problem (RS, LS, WdP), pp. 624–636.
- TLCA-2003-Joly #encoding
- Encoding of the Halting Problem into the Monster Type & Applications (TJ), pp. 153–166.
- DiGRA-2003-Huber #game studies
- Ka as shomin-geki: Problematizing videogame studies (WHH).
- DiGRA-2003-Jorgensen #game studies
- Problem Solving: The Essence of Player Action in Computer Games (KJ).
- CHI-2003-BlackmonKP #usability #web
- Repairing usability problems identified by the cognitive walkthrough for the web (MHB, MK, PGP), pp. 497–504.
- ICEIS-v2-2003-IsikK #network
- Partially Connected Neural Networks for Mapping Problems (CI, SK), pp. 469–473.
- ICEIS-v2-2003-OkuharaU #multi
- Logistics By Applying Evolutionary Computation to Multicommodity Flow Problem (KO, NU), pp. 511–514.
- ICEIS-v3-2003-GoeppK #evolution #information management #towards
- Towards a Definition of the Key-Problems in Information System Evolution — Formulating Problems to Better Address Information System Projects (VG, FK), pp. 586–589.
- ICEIS-v3-2003-MatsumotoT #modelling
- A Promising Manifesto for E-Business Value Modeling Problems (MJM, MT), pp. 112–120.
- CIKM-2003-Liben-NowellK #network #predict #social
- The link prediction problem for social networks (DLN, JMK), pp. 556–559.
- ICML-2003-KennedyJ #learning
- Characteristics of Long-term Learning in Soar and its Application to the Utility Problem (WGK, KADJ), pp. 337–344.
- ICML-2003-KwokT03a #kernel
- The Pre-Image Problem in Kernel Methods (JTK, IWT), pp. 408–415.
- LOPSTR-2003-FlenerPA #combinator #modelling #relational
- Introducing esra, a Relational Language for Modelling Combinatorial Problems (PF, JP, MÅ), pp. 214–232.
- PADL-2003-FernandezHS #combinator #constraints #functional #logic
- Solving Combinatorial Problems with a Constraint Functional Logic Language (AJF, MTHG, FSP), pp. 320–338.
- ESEC-FSE-2003-McCamantE #component #predict
- Predicting problems caused by component upgrades (SM, MDE), pp. 287–296.
- ICSE-2003-BakerNH #education #game studies #re-engineering
- Problems and Programmers: An Educational Software Engineering Card Game (AB, EON, AvdH), pp. 614–621.
- ICSE-2003-RaghavachariRJ #configuration management #performance #reliability
- The Deployer’s Problem: Configuring Application Servers for Performance and Reliability (MR, DR, RDJ), pp. 484–489.
- SAC-2003-HareJ #algorithm #search-based
- A Spanning Tree-Based Genetic Algorithm for Some Instances of the Rectilinear Steiner Problem with Obstacles (RMH, BAJ), pp. 725–729.
- SAC-2003-LiLR #approach #hybrid
- A Hybrid AI Approach for Nurse Rostering Problem (HL, AL, BR), pp. 730–735.
- SAC-2003-RaidlJ #algorithm #bound #heuristic
- Greedy Heuristics and an Evolutionary Algorithm for the Bounded-Diameter Minimum Spanning Tree Problem (GRR, BAJ), pp. 747–752.
- SAC-2003-RaisanenW #communication #evaluation #multi #network #optimisation
- Multi-objective Optimization in the Area Coverage Problems for Cellular Communication Networks: Evaluation of an Elitist Evolutionary Strategy (LR, RMW), pp. 714–720.
- DAC-2003-NgPMJ #industrial
- Solving the latch mapping problem in an industrial setting (KN, MRP, RM, JJ), pp. 442–447.
- DATE-2003-SchlebuschSSGMLGSK #design #question #transaction
- Transaction Based Design: Another Buzzword or the Solution to a Design Problem? (HJS, GS, DS, DG, CM, CKL, FG, SS, JK), pp. 10876–10879.
- PDP-2003-GarciaMS #algorithm #multi #sequence
- A Coarse-Grained Multicomputer Algorithm for the Longest Common Subsequence Problem (TG, JFM, DS), pp. 349–356.
- PDP-2003-SeragiottoFGMM #automation #distributed #on the #parallel #performance #source code #using
- On Using Aksum for Semi-Automatically Searching of Performance Problems in Parallel and Distributed Programs (CSJ, TF, MG, GM, HM), pp. 385–392.
- PDP-2003-SpiteriGBM #linear #parallel
- Parallelization of Subdomain Methods with Overlapping for Linear and Nonlinear Convection-Diffusion Problems. (PS, RG, DEB, MC), pp. 341–348.
- STOC-2003-AlonAA #online #set
- The online set cover problem (NA, BA, YA, NB, JN), pp. 100–105.
- STOC-2003-CharikarOP #algorithm #clustering #streaming
- Better streaming algorithms for clustering problems (MC, LO, RP), pp. 30–39.
- STOC-2003-Gurvits #complexity #quantum
- Classical deterministic complexity of Edmonds’ Problem and quantum entanglement (LG), pp. 10–19.
- STOC-2003-JayramKKR #bound
- Cell-probe lower bounds for the partial match problem (TSJ, SK, RK, YR), pp. 667–672.
- STOC-2003-Plaxton #algorithm #approximate
- Approximation algorithms for hierarchical location problems (CGP), pp. 40–49.
- STOC-2003-Thorup #constant #integer
- Integer priority queues with decrease key in constant time and the single source shortest paths problem (MT), pp. 149–158.
- STOC-2003-VegaKKR #approximate #clustering
- Approximation schemes for clustering problems (WFdlV, MK, CK, YR), pp. 50–58.
- CADE-2003-CohenMPS #permutation
- Certifying Solutions to Permutation Group Problems (AMC, SHM, MP, VS), pp. 258–273.
- CADE-2003-Lynch #unification
- Schematic Saturation for Decision and Unification Problems (CL), pp. 427–441.
- CAV-2003-XieDIP #verification
- Dense Counter Machines and Verification Problems (GX, ZD, OHI, PSP), pp. 93–105.
- CSL-2003-KanovichV
- Coping Polynomially with Numerous but Identical Elements within Planning Problems (MIK, JV), pp. 285–298.
- CSL-2003-MaksimovaV #calculus #complexity
- Complexity of Some Problems in Modal and Intuitionistic Calculi (LM, AV), pp. 397–412.
- LICS-2003-Bulatov #constraints
- Tractable conservative Constraint Satisfaction Problems (AAB), p. 321–?.
- SAT-2003-Parisi #approach #on the #probability #random #satisfiability
- On the Probabilistic Approach to the Random Satisfiability Problem (GP), pp. 203–213.
- SAT-2003-PorschenRS #algorithm #linear #satisfiability
- Linear Time Algorithms for Some Not-All-Equal Satisfiability Problems (SP, BR, ES), pp. 172–187.
- SAT-2003-Prestwich
- Local Search on SAT-encoded Colouring Problems (SDP), pp. 105–119.
- SAT-2003-Pretolani #reduction #satisfiability
- Hypergraph Reductions and Satisfiability Problems (DP), pp. 383–397.
- SAT-2003-SabharwalBK #learning #performance #using
- Using Problem Structure for Efficient Clause Learning (AS, PB, HAK), pp. 242–256.
- SAT-2003-SemerjianM #case study #physics #random #satisfiability
- A Study of Pure Random Walk on Random Satisfiability Problems with “Physical” Methods (GS, RM), pp. 120–134.
- PODS-2002-Chirkova #bound #query
- The View-Selection Problem Has an Exponential-Time Lower Bound for Conjunctive Queries and Views (RC), pp. 159–168.
- CSEET-2002-Armarego #design #learning
- Advanced Software Design: A Case in Problem-Based Learning (JA), pp. 44–54.
- ITiCSE-2002-Gries #education
- Problems with CS education (DG), p. 135.
- CSMR-2002-RaysideK #algorithm #graph #program analysis #reachability
- A Generic Worklist Algorithm for Graph Reachability Problems in Program Analysis (DR, KK), pp. 67–76.
- ICSM-2002-Kajko-Mattsson #maintenance #maturity
- Corrective Maintenance Maturity Model: Problem Management (MKM), pp. 486–490.
- DLT-2002-BonizzoniFMZ #linear
- Decision Problems for Linear and Circular Splicing Systems (PB, CdF, GM, RZ), pp. 78–92.
- DLT-2002-Kari #infinity
- Infinite Snake Tiling Problems (JK), pp. 67–77.
- ICALP-2002-BrodalLOP #statistics #string
- Solving the String Statistics Problem in Time O(n log n) (GSB, RBL, AÖ, CNSP), pp. 728–739.
- ICALP-2002-CharikarIP #algorithm #orthogonal #query #set
- New Algorithms for Subset Query, Partial Match, Orthogonal Range Searching, and Related Problems (MC, PI, RP), pp. 451–462.
- ICALP-2002-CzumajLZ #approximate #design #network #polynomial
- Polynomial-Time Approximation Schemes for the Euclidean Survivable Network Design Problem (AC, AL, HZ), pp. 973–984.
- ICALP-2002-Dalmau #constraints #nondeterminism
- Constraint Satisfaction Problems in Non-deterministic Logarithmic Space (VD), pp. 414–425.
- ICALP-2002-IwamaT #online
- Removable Online Knapsack Problems (KI, ST), pp. 293–305.
- ICALP-2002-JakobyL #symmetry
- Paths Problems in Symmetric Logarithmic Space (AJ, ML), pp. 269–280.
- ICALP-2002-KarhumakiL #equivalence #finite
- The Equivalence Problem of Finite Substitutions on ab*c, with Applications (JK, LPL), pp. 812–820.
- ICALP-2002-Mannila #data mining #mining
- Local and Global Methods in Data Mining: Basic Techniques and Open Problems (HM), pp. 57–68.
- ICALP-2002-WuC
- Optimal Net Surface Problems with Applications (XW, DZC), pp. 1029–1042.
- RTA-2002-LevyV #higher-order #unification
- Currying Second-Order Unification Problems (JL, MV), pp. 326–339.
- ICGT-2002-BeckPS #graph transformation #scheduling
- Graph Transformations for the Vehicle Routing and Job Shop Scheduling Problems (JCB, PP, ES), pp. 60–74.
- CAiSE-2002-Kajko-Mattsson
- Evaluating CM3: Problem Management (MKM), pp. 436–451.
- ICEIS-2002-FloresG #algorithm #case study #estimation #fuzzy #learning
- Applicability of Estimation of Distribution Algorithms to the Fuzzy Rule Learning Problem: A Preliminary Study (MJF, JAG), pp. 350–357.
- ICPR-v1-2002-PhillipsSRGB #algorithm #challenge #identification #set
- The Gait Identification Challenge Problem: Data Sets and Baseline Algorithm (PJP, SS, IRV, PG, KWB), pp. 385–388.
- ICPR-v2-2002-AltyncayD #classification #multi #normalisation #question #why
- Why Does Output Normalization Create Problems in Multiple Classifier Systems? (HA, MD), pp. 775–778.
- ICPR-v2-2002-Torkkola02a #feature model #learning
- Learning Feature Transforms Is an Easier Problem Than Feature Selection (KT), pp. 104–107.
- ICPR-v3-2002-CooperWABCHKKLOVVJKLM #geometry
- Bayesian Pot-Assembly from Fragments as Problems in Perceptual-Grouping and Geometric-Learning (DBC, ARW, SA, JB, YC, DH, KK, WK, FFL, XO, SV, EV, MSJ, BBK, DHL, DM), pp. 297–302.
- ICPR-v3-2002-HuangLLM
- Solving the Small Sample Size Problem of LDA (RH, QL, HL, SM), pp. 29–32.
- ICPR-v3-2002-Klette02a
- Switche May Solve Adjacency Problems (RK), pp. 907–910.
- ICPR-v4-2002-MannL
- Optical Snow and the Aperture Problem (RM, MSL), pp. 264–267.
- RE-2002-HallJLNR #architecture #requirements #using
- Relating Software Requirements and Architectures Using Problem Frames (JGH, MJ, RCL, BN, LR), pp. 137–144.
- SAC-2002-ChadesSC #approach #assessment #heuristic
- A heuristic approach for solving decentralized-POMDP: assessment on the pursuit problem (IC, BS, FC), pp. 57–62.
- SAC-2002-DiazWB #documentation #xml
- Inter-organizational document exchange: facing the conversion problem with XML (LMD, EW, PB), pp. 1043–1047.
- SAC-2002-LiL
- Local search with annealing-like restarts to solve the vehicle routing problem with time windows (HL, AL), pp. 560–565.
- SAC-2002-ParsopoulosV #multi #optimisation
- Particle swarm optimization method in multiobjective problems (KEP, MNV), pp. 603–607.
- CC-2002-MiecznikowskiH #bytecode #java
- Decompiling Java Bytecode: Problems, Traps and Pitfalls (JM, LJH), pp. 111–127.
- DAC-2002-AnderssonBCH #approach #automation #design #proving
- A proof engine approach to solving combinational design automation problems (GA, PB, BC, ZH), pp. 725–730.
- DATE-2002-FavalliM #fault #self
- Problems Due to Open Faults in the Interconnections of Self-Checking Data-Paths (MF, CM), pp. 612–617.
- DATE-2002-GoldbergPB #algorithm #satisfiability #symmetry #using
- Using Problem Symmetry in Search Based Satisfiability Algorithms (EIG, MRP, RKB), pp. 134–141.
- DATE-2002-HuangTXWL #algorithm #polynomial
- A Polynomial Time Optimal Diode Insertion/Routing Algorithm for Fixing Antenna Problem (LDH, XT, HX, DFW, IML), pp. 470–475.
- DATE-2002-KoranneC #network #scheduling
- Formulation of SOC Test Scheduling as a Network Transportation Problem (SK, VSC), p. 1125.
- DATE-2002-LampeL #optimisation
- Global Optimization Applied to the Oscillator Problem (SL, SL), pp. 322–326.
- DATE-2002-LeeLFCH
- A New Formulation for SOC Floorplan Area Minimization Problem (CHL, YCL, WYF, CCC, TMH), p. 1100.
- HPDC-2002-DeBardelebenLPS #framework #named #performance
- Coven — A Framework for High Performance Problem Solving Environments (ND, WBLI, SP, DCSJ), p. 291–?.
- PDP-2002-BaragliaFL #named
- Meta: A Web-Based Metacomputing Environment to Build a Computational Chemistry Problem Solving Environment (RB, RF, DL), pp. 49–54.
- PDP-2002-CzechC #parallel
- Parallel Simulated Annealing for the Vehicle Routing Problem with Time Windows (ZJC, PC), p. 376–?.
- PDP-2002-MaciasSO #grid #optimisation
- Solving Non-Smooth Unconstrained Optimization Problem with LAMGAC in a LAN-WLAN Grid Domain (EMM, ÁS, CNOG), p. 471–?.
- PDP-2002-RuizOP #parallel
- Exploiting the Multilevel Parallelism and the Problem Structure in the Numerical Solution of Stiff ODEs (JMMR, JO, JACdlP), pp. 173–180.
- STOC-2002-Aaronson #bound #quantum
- Quantum lower bound for the collision problem (SA), pp. 635–642.
- STOC-2002-AdlemanCGHKER #combinator #optimisation #self
- Combinatorial optimization problems in self-assembly (LMA, QC, AG, MDAH, DK, PMdE, PWKR), pp. 23–32.
- STOC-2002-AlonVKK #approximate #random
- Random sampling and approximation of MAX-CSP problems (NA, WFdlV, RK, MK), pp. 232–239.
- STOC-2002-BeameV #communication #complexity #multi #nearest neighbour #trade-off
- Time-space tradeoffs, multiparty communication complexity, and nearest-neighbor problems (PB, EV), pp. 688–697.
- STOC-2002-ElkinK #algorithm #approximate #combinator
- Combinatorial logarithmic approximation algorithm for directed telephone broadcast problem (ME, GK), pp. 438–447.
- STOC-2002-Hallgren #algorithm #equation #polynomial #quantum
- Polynomial-time quantum algorithms for Pell’s equation and the principal ideal problem (SH), pp. 653–658.
- STOC-2002-JainMS #approach
- A new greedy approach for facility location problems (KJ, MM, AS), pp. 731–740.
- STOC-2002-Molloy02a #constraints #modelling #random
- Models and thresholds for random constraint satisfaction problems (MM), pp. 209–217.
- TACAS-2002-GentiliniPP #simulation
- Simulation as Coarsest Partition Problem (RG, CP, AP), pp. 415–430.
- CSL-2002-BarbanchonG #linear
- Local Problems, Planar Local Problems and Linear Time (RB, EG), pp. 397–411.
- LICS-2002-HesseI #complexity
- Complete Problems for Dynamic Complexity Classes (WH, NI), p. 313–?.
- SAT-2002-CreignouD #random #satisfiability
- Random generalized satisfiability problems (NC, HD), p. 2.
- SAT-2002-EglyWP #on the
- On deciding subsumption problems (UE, SW, RP), p. 36.
- SAT-2002-GentP #encoding #satisfiability
- SAT encodings of the stable marriage problem with ties and incomplete lists (IG, PP), p. 19.
- SAT-2002-Kusper #linear #satisfiability
- Solving the resolution-free SAT problem by hyper-unit propagation in linear time (GK), p. 32.
- SAT-2002-TakenakaH #algorithm #satisfiability
- An analog algorithm for the satisfiability problem (YT, AH), p. 40.
- SAT-2002-ZhaoB #equivalence
- Extension and equivalence problems for clause minimal formulas (XZ, HKB), p. 43.
- TestCom-2002-WilliamsP #integer #interactive #test coverage
- Formulation of the Interaction Test Coverage Problem as an Integer Program (AWW, RLP), p. 283–?.
- CBSE-2001-Hamlet #component #synthesis
- Component Synthesis Theory: The Problem of Scale (DH), p. 15.
- CBSE-2001-PreissW #composition #towards
- Towards a Composition Model Problem based on IEC61850 (OP, AW), p. 18.
- WICSA-2001-Laine #architecture #development #embedded #object-oriented #scalability
- The Role of SW Architectures in Solving Fundamental Problems in Object-Oriented Development of Large Embedded SW Systems (PKL), pp. 14–23.
- ICDAR-2001-KoerichSS #distributed #recognition #scalability #word
- A Distributed Scheme for Lexicon-Driven Handwritten Word Recognition and its Application to Large Vocabulary Problems (ALK, RS, CYS), pp. 660–664.
- VLDB-2001-ChirkovaHS #formal method
- A Formal Perspective on the View Selection Problem (RC, AYH, DS), pp. 59–68.
- ITiCSE-2001-Cassel #student #summary
- Reading summaries: relating class to student’s problems with the current reading assignment (LNC), p. 188.
- ITiCSE-2001-Ginat #algorithm #learning
- Metacognitive awareness utilized for learning control elements in algorithmic problem solving (DG), pp. 81–84.
- ITiCSE-2001-SatratzemiDE #assessment #visualisation
- A system for program visualization and problem-solving path assessment of novice programmers (MS, VD, GE), pp. 137–140.
- ITiCSE-2001-Sooriamurthi #recursion
- Problems in comprehending recursion and suggested solutions (RS), pp. 25–28.
- ITiCSE-2001-Velazquez-Iturbide #algorithm
- A first problem for the algorithms course (JÁVI), p. 187.
- CSMR-2001-Kajko-MattssonWFAMEFJTH #process #taxonomy
- Taxonomy of Problem Management Activities (MKM, UW, SF, GAI, MM, SE, TF, SEJ, ST, MH), pp. 1–10.
- PASTE-2001-Hind #analysis #pointer #question
- Pointer analysis: haven’t we solved this problem yet? (MH), pp. 54–61.
- DLT-2001-CulikKK #automaton
- A Note on Synchronized Automata and Road Coloring Problem (KCI, JK, JK), pp. 175–185.
- ICALP-2001-AlberFN #complexity #exponential #graph
- Parameterized Complexity: Exponential Speed-Up for Planar Graph Problems (JA, HF, RN), pp. 261–272.
- ICALP-2001-ChrobakCINSW #multi #scheduling
- The Buffer Minimization Problem for Multiprocessor Scheduling with Conflicts (MC, JC, CI, JN, JS, GJW), pp. 862–874.
- ICALP-2001-GandhiKS #algorithm #approximate
- Approximation Algorithms for Partial Covering Problems (RG, SK, AS), pp. 225–236.
- ICALP-2001-Kirsten #monad #reduction
- The Star Problem in Trace Monoids: Reductions Beyond C4 (DK), pp. 591–602.
- ICALP-2001-Kunc #decidability
- The Trace Coding Problem Is Undecidable (MK), pp. 603–614.
- ICALP-2001-LinCJW #sequence
- The Longest Common Subsequence Problem for Sequences with Nested Arc Annotations (GHL, ZZC, TJ, JW), pp. 444–455.
- ICALP-2001-Seiden #on the #online
- On the Online Bin Packing Problem (SSS), pp. 237–248.
- RTA-2001-OyamaguchiO #confluence #term rewriting #unification
- The Unification Problem for Confluent Right-Ground Term Rewriting Systems (MO, YO), pp. 246–260.
- CAiSE-2001-Kajko-Mattsson
- A Glimpse into CM3: Problem Management (MKM), pp. 469–472.
- ICEIS-v1-2001-SoonthornphisajK #algorithm #categorisation #set #using #web
- The Effects of Differnet Feature Sets on the Web Page Categorization Problem Using the Iterative Cross-Training Algorithm (NS, BK), pp. 404–410.
- ICEIS-v2-2001-EtcheverryLD #approach #coordination
- An Approach for Coordination Problem Solving (PE, PL, PD), pp. 880–883.
- ICEIS-v2-2001-OmelayenkoF #analysis #integration
- An Analysis of B2B Catalogue Integration Problems (BO, DF), pp. 945–952.
- ICML-2001-LatinneSD #classification #multi
- Adjusting the Outputs of a Classifier to New a Priori Probabilities May Significantly Improve Classification Accuracy: Evidence from a multi-class problem in remote sensing (PL, MS, CD), pp. 298–305.
- ICML-2001-SatoK #learning #markov
- Average-Reward Reinforcement Learning for Variance Penalized Markov Decision Problems (MS, SK), pp. 473–480.
- ICML-2001-SchefferW #incremental #information management
- Incremental Maximization of Non-Instance-Averaging Utility Functions with Applications to Knowledge Discovery Problems (TS, SW), pp. 481–488.
- ICML-2001-Zhang #approximate #bound
- Some Sparse Approximation Bounds for Regression Problems (TZ0), pp. 624–631.
- KDD-2001-IndurkhyaW #classification #rule-based
- Solving regression problems with rule-based ensemble classifiers (NI, SMW), pp. 287–292.
- SIGIR-2001-GodaKTFC #optimisation #query
- Query Optimization for Vector Space Problems (KG, MK, TT, OF, AC), pp. 416–417.
- TOOLS-USA-2001-Meyer #object-oriented #programming
- Open Problems in Object-Oriented Programming (BM), p. 8.
- GCSE-2001-Lopez-HerrejonB #product line #standard
- A Standard Problem for Evaluating Product-Line Methodologies (RELH, DSB), pp. 10–24.
- PADL-2001-FlenerHK01a #metaheuristic #set
- A Meta-heuristic for Subset Problems (PF, BH, ZK), pp. 274–287.
- SAIG-2001-SasanoHT #generative #multi #performance #source code
- Generation of Efficient Programs for Solving Maximum Multi-marking Problems (IS, ZH, MT), pp. 72–91.
- RE-2001-NelsonCA
- Geographic Problem Frames (MAVN, DDC, PSCA), pp. 306–307.
- ESEC-FSE-2001-DavisGPJU #architecture #interactive
- A notation for problematic architecture interactions (LAD, RFG, JP, GJ, DJU), pp. 132–141.
- SAC-2001-BaroneBVM #algorithm #analysis #approximate
- An approximation algorithm for the shortest common supersequence problem: an experimental analysis (PB, PB, GDV, GM), pp. 56–60.
- SAC-2001-DeermanLP #algorithm #predict #search-based
- Linkage-learning genetic algorithm application to the protein structure prediction problem (KRD, GBL, RP), pp. 333–339.
- SAC-2001-FernandesTMR #algorithm #search-based #using
- Using assortative mating in genetic algorithms for vector quantization problems (CMF, RT, CM, ACR), pp. 361–365.
- SAC-2001-GaliassoW #algorithm #hybrid #multi #search-based
- A hybrid genetic algorithm for the point to multipoint routing problem with single split paths (PG, RLW), pp. 327–332.
- SAC-2001-JulstromR #algorithm #graph
- Weight-biased edge-crossover in evolutionary algorithms for wto graph problems (BAJ, GRR), pp. 321–326.
- SAC-2001-ThangiahSM #architecture
- An agent architecture for vehicle routing problems (SRT, OS, WM), pp. 517–521.
- SAC-2001-ZhouCH #correlation #identification #optimisation #set #using
- Identifying the most significant pairwise correlations of residues in different positions of helices: the subset selection problem using least squares optimization (XZ, GC, MTH), pp. 51–55.
- DATE-2001-MinatoI #combinator #scalability #streaming
- Streaming BDD manipulation for large-scale combinatorial problems (SiM, SI), pp. 702–707.
- HPDC-2001-SchuchardtMS #authoring #data transformation #distributed #open data #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–?.
- PDP-2001-Czech #delivery #parallel
- Parallel Simulated Annealing for the Delivery Problem (ZJC), pp. 219–226.
- PDP-2001-SemeM #algorithm #geometry #parallel #performance
- Efficient BSR-Based Parallel Algorithms for Geometrical Problems (DS, JFM), pp. 265–272.
- ESOP-2001-CadoliS #compilation #satisfiability #specification
- Compiling Problem Specifications into SAT (MC, AS), pp. 387–401.
- FoSSaCS-2001-Bojanczyk #automaton #finite #graph
- The Finite Graph Problem for Two-Way Alternating Automata (MB), pp. 88–103.
- STOC-2001-AjtaiKS #algorithm
- A sieve algorithm for the shortest lattice vector problem (MA, RK, DS), pp. 601–610.
- STOC-2001-AryaGKMP #heuristic
- Local search heuristic for k-median and facility location problems (VA, NG, RK, AM, KM, VP), pp. 21–29.
- STOC-2001-BorgsCP #clustering #integer #scalability
- Sharp threshold and scaling window for the integer partitioning problem (CB, JTC, BP), pp. 330–336.
- STOC-2001-GoemansW #algorithm #approximate #programming
- Approximation algorithms for MAX-3-CUT and other problems via complex semidefinite programming (MXG, DPW), pp. 443–452.
- STOC-2001-GrigniSVV #algorithm #quantum
- Quantum mechanical algorithms for the nonabelian hidden subgroup problem (MG, LJS, MV, UVV), pp. 68–74.
- STOC-2001-GuhaMM #approximate #constant
- A constant factor approximation for the single sink edge installation problems (SG, AM, KM), pp. 383–388.
- STOC-2001-GuptaKKRY #design #multi #network
- Provisioning a virtual private network: a network design problem for multicommodity flow (AG, JMK, AK, RR, BY), pp. 389–398.
- STOC-2001-MossR #algorithm #approximate
- Approximation algorithms for constrained for constrained node weighted steiner tree problems (AM, YR), pp. 373–382.
- STOC-2001-Tokuyama #multi #optimisation #parametricity
- Minimax parametric optimization problems and multi-dimensional parametric searching (TT), pp. 75–83.
- STOC-2001-Trevisan #bound #optimisation
- Non-approximability results for optimization problems on bounded degree instances (LT), pp. 453–461.
- TACAS-2001-RiccaT #analysis #testing #web
- Building a Tool for the Analysis and Testing of Web Applications: Problems and Solutions (FR, PT), pp. 373–388.
- LICS-2001-Ganzinger #concept #decidability #semantics #word
- Relating Semantic and Proof-Theoretic Concepts for Polynominal Time Decidability of Uniform Word Problems (HG), pp. 81–90.
- LICS-2001-SzwastT #on the #transitive
- On the Decision Problem for the Guarded Fragment with Transitivity (WS, LT), pp. 147–156.
- SAT-2001-AmirM #composition #satisfiability #using
- Solving Satisfiability using Decomposition and the Most Constrained Subproblem (EA, SM), pp. 329–343.
- SAT-2001-HorvitzRGKSC #approach
- A Bayesian Approach to Tackling Hard Computational Problems (EH, YR, CPG, HAK, BS, DMC), pp. 376–391.
- SAT-2001-HuntMS #complexity #constraints #probability #quantifier
- Complexity and Approximability of Quantified and Stochastic Constraint Satisfaction Problems (HBHI, MVM, RES), pp. 217–230.
- SAT-2001-KautzRAGSS #satisfiability
- Balance and Filtering in Structured Satisfiable Problems (HAK, YR, DA, CPG, BS, MES), pp. 2–18.
- SAT-2001-RanderathSBHKMSC #graph #satisfiability
- A Satisfiability Formulation of Problems on Level Graphs (BR, ES, EB, PLH, AK, KM, BS, OC), pp. 269–277.
- SAT-2001-Shlyakhter #effectiveness #generative #symmetry
- Generating effective symmetry-breaking predicates for search problems (IS), pp. 19–35.
- ECDL-2000-LimT #internet
- Effects of Cognitive and Problem Solving Style on Internet Search Tool (LTY, TEK), pp. 389–394.
- HT-2000-Willerton #hypermedia
- Structure problems in hypertext mysteries (CW), pp. 234–235.
- PODS-2000-AngiulliBIP
- Computational Properties of Metaquerying Problems (FA, RBEZ, GI, LP), pp. 237–244.
- ITiCSE-2000-Kumar #generative
- Dynamically generating problems on static scope (AK), pp. 9–12.
- ITiCSE-2000-WuZ #fuzzy
- Embedding problem of noncompact fuzzy number space E~ (II) (CW, BZ), pp. 135–142.
- ICSM-2000-AntoniolCCT #approach
- An Approach to Limit the Wynot Problem (GA, GC, AC, MT), pp. 207–215.
- CIAA-2000-Neto #adaptation #automaton
- Solving Complex Problems Efficiently with Adaptive Automata (JJN), pp. 340–342.
- ICALP-2000-AmbuhlGS #algorithm
- Optimal Projective Algorithms for the List Update Problem (CA, BG, BvS), pp. 305–316.
- ICALP-2000-BolligW #bound
- Asymptotically Optimal Bounds for OBDDs and the Solution of Some Basic OBDD Problems (BB, IW), pp. 187–198.
- ICALP-2000-BulatovKJ #algebra #constraints #finite
- Constraint Satisfaction Problems and Finite Algebras (AAB, AAK, PJ), pp. 272–282.
- ICALP-2000-CzumajL #approximate #multi #performance
- Fast Approximation Schemes for Euclidean Multi-connectivity Problems (AC, AL), pp. 856–868.
- ICALP-2000-ElkinP
- Strong Inapproximability of the Basic k-Spanner Problem (ME, DP), pp. 636–647.
- ICALP-2000-Hastad #algorithm #approximate #np-hard #optimisation #performance #question
- Which NP-Hard Optimization Problems Admit Non-trivial Efficient Approximation Algorithms? (JH), p. 235.
- ICALP-2000-MargaraS #network
- Wavelength Assignment Problem on All-Optical Networks with k Fibres per Link (LM, JS), pp. 768–779.
- ICALP-2000-Mayr #bisimulation #complexity #on the #parallel #process
- On the Complexity of Bisimulation Problems for Basic Parallel Processes (RM), pp. 329–341.
- WLC-2000-DomosiI #context-sensitive grammar #parsing
- A Parsing Problem for Context-Sensitive Languages (PD, MI), pp. 183–184.
- RTA-2000-Lohrey #confluence #strict #word
- Word Problems and Confluence Problems for Restricted Semi-Thue Systems (ML), pp. 172–186.
- RTA-2000-Statman #combinator #on the #word
- On the Word Problem for Combinators (RS), pp. 203–213.
- ICFP-2000-SasanoHTO #algorithm #linear
- Make it practical: a generic linear-time algorithm for solving maximum-weightsum problems (IS, ZH, MT, MO), pp. 137–149.
- ICEIS-2000-KostarasMMP #industrial #multi #scalability
- Solving Large Scale Multi-Criteria Job Sequencing Problems in Real Industrial Environments (GK, IM, GM, JEP), pp. 157–162.
- ICML-2000-Bowling #convergence #learning #multi
- Convergence Problems of General-Sum Multiagent Reinforcement Learning (MHB), pp. 89–94.
- ICML-2000-Domingos #classification
- Bayesian Averaging of Classifiers and the Overfitting Problem (PMD), pp. 223–230.
- ICML-2000-MollPB #machine learning
- Machine Learning for Subproblem Selection (RM, TJP, AGB), pp. 615–622.
- ICML-2000-Randlov #learning #physics
- Shaping in Reinforcement Learning by Changing the Physics of the Problem (JR), pp. 767–774.
- ICML-2000-SebbanN
- Instance Pruning as an Information Preserving Problem (MS, RN), pp. 855–862.
- ICML-2000-WnagZ #approach #lazy evaluation #learning #multi
- Solving the Multiple-Instance Problem: A Lazy Learning Approach (JW, JDZ), pp. 1119–1126.
- ICML-2000-ZelikovitzH #classification #using
- Improving Short-Text Classification using Unlabeled Data for Classification Problems (SZ, HH), pp. 1191–1198.
- ICPR-v1-2000-DuchesneH #approach #artificial reality
- A Point-Based Approach to the Interposition Problem in Augmented Reality (CD, JYH), pp. 1261–1265.
- ICPR-v1-2000-NielsenP #adaptation #representation #segmentation #using
- A Solution to the Problem of Segmentation near Edges Using Adaptable Class-Specific Representation (CFN, PJP), pp. 1436–1440.
- ICPR-v2-2000-HoB #classification #complexity
- Measuring the Complexity of Classification Problems (TKH, MB), pp. 2043–2047.
- ICPR-v2-2000-LeeC #feature model #multi #optimisation
- Optimizing Feature Extraction for Multiclass Problems (CL, EC), pp. 2402–2405.
- KDD-2000-GardnerB #data mining #mining
- Data mining solves tough semiconductor manufacturing problems (MG, JB), pp. 376–383.
- KR-2000-BaralMS #using
- Formulating diagnostic problem solving using an action language with narratives and sensing (CB, SAM, TCS), pp. 311–322.
- KR-2000-IsmailS #reasoning
- Two Problems with Reasoning and Acting in Time (HOI, SCS), pp. 355–365.
- ECOOP-2000-GrogonoS
- Copying and Comparing: Problems and Solutions (PG, MS), pp. 226–250.
- TOOLS-PACIFIC-2000-Taylor #architecture #object-oriented
- Problem Frames and Object-Oriented Software Architecture (PRT), pp. 70–81.
- PADL-2000-YunesMS #approach #hybrid #scalability #scheduling
- A Hybrid Approach for Solving Large Scale Crew Scheduling Problems (THY, AVM, CCdS), pp. 293–307.
- PPDP-2000-LeuschelL #deduction #petri net
- Solving coverability problems of petri nets by partial deduction (ML, HL), pp. 268–279.
- ICSE-2000-Brewer
- Improving problem-oriented mailing list archives with MCS (RSB), pp. 95–104.
- ICSE-2000-Bryant #question #re-engineering
- It’s engineering Jim ... but not as we know it: software engineering — solution to the software crisis, or part of the problem? (AB), pp. 78–87.
- SAC-2000-Gottlieb #algorithm #multi
- Permutation-Based Evolutionary Algorithms for Multidimensional Knapsack Problems (JG), pp. 408–414.
- SAC-2000-GottliebK #algorithm
- Selection in Evolutionary Algorithms for the Traveling Salesman Problem (JG, TK), pp. 415–421.
- SAC-2000-LimT #animation #evolution #interactive
- Solve Customers’ Problems: Interactive Evolution for Tinkering with Computer Animation (ISL, DT), pp. 404–407.
- SAC-2000-MarchioriS #algorithm #constraints #random #search-based
- A Genetic Local Search Algorithm for Random Binary Constraint Satisfaction Problems (EM, AGS), pp. 458–462.
- SAC-2000-PowerM #approach #c++ #modelling #programming language
- An Approach for Modeling the Name Lookup Problem in the C++ Programming Language (JFP, BAM), pp. 792–796.
- SAC-2000-RaidlJ #algorithm #search-based
- A Weighted Coding in a Genetic Algorithm for the Degree-Constrained Minimum Spanning Tree Problem (GRR, BAJ), pp. 440–445.
- SAC-2000-RibeiroHOR #algorithm #implementation #parallel
- A Parallel Algorithm for the Routing Problem: An Implementation in The Parallel Computer IBM-SP2 (CMR, FH, FCJdO, JFFR), pp. 649–654.
- SAC-2000-RossiMK #adaptation #algorithm #satisfiability
- An Adaptive Evolutionary Algorithm for the Satisfiability Problem (CR, EM, JNK), pp. 463–469.
- SAC-2000-RudraG #adaptation #clustering #using
- Adaptive Use of a Cluster of PCs for Data Warehousing Applications: Some Problems and Issues (AR, RPG), pp. 698–703.
- SAC-2000-YunesMS #scalability #scheduling
- Solving Very Large Crew Scheduling Problems to Optimality (THY, AVM, CCdS), pp. 446–451.
- DAC-2000-NarasimhanR #bound #on the #scheduling #synthesis
- On lower bounds for scheduling problems in high-level synthesis (MN, JR), pp. 546–551.
- DATE-2000-CordoneFSC #approach #heuristic #performance
- An Efficient Heuristic Approach to Solve the Unate Covering Problem (RC, FF, DS, RWC), pp. 364–371.
- HPDC-2000-AllenBGHLMRSS #grid
- The Cactus Code: A Problem Solving Environment for the Grid (GA, WB, TG, HCH, GL, AM, TR, ES, JS), pp. 253–260.
- HPDC-2000-GermainPMJ #named #parallel
- Uintah: A Massively Parallel Problem Solving Environment (JDdSG, SGP, JM, CRJ), pp. 33–42.
- PDP-2000-Cerin #geometry #implementation #performance #source code #towards
- Towards efficient BSP implementations of BSR programs for some computational geometry problems (CC), pp. 357–364.
- PDP-2000-Czech #clustering #parallel
- Parallel simulated annealing for the set-partitioning problem (ZJC), pp. 343–350.
- FASE-2000-GruerHK #design #network #specification #using #verification
- Verification of Object-Z Specifications by Using Transition Systems: Application to the Radiomobile Network Design Problem (PG, VH, AK), pp. 222–236.
- FoSSaCS-2000-LaroussinieS #bisimulation #equivalence #explosion
- The State Explosion Problem from Trace to Bisimulation Equivalence (FL, PS), pp. 192–207.
- STOC-2000-AleksandrovMS #algorithm #approximate #geometry
- Approximation algorithms for geometric shortest path problems (LA, AM, JRS), pp. 286–295.
- STOC-2000-BarkolR #bound #nearest neighbour
- Tighter bounds for nearest neighbor search and related problems in the cell probe model (OB, YR), pp. 388–396.
- STOC-2000-BlumKW #learning #query #statistics
- Noise-tolerant learning, the parity problem, and the statistical query model (AB, AK, HW), pp. 435–440.
- STOC-2000-CzumajS #algorithm #approach #satisfiability #scheduling
- A new algorithm approach to the general Lovász local lemma with applications to scheduling and satisfiability problems (AC, CS), pp. 38–47.
- STOC-2000-GuptaT #algorithm #approximate #classification #constant
- A constant factor approximation algorithm for a class of classification problems (AG, ÉT), pp. 652–658.
- STOC-2000-KabanetsC
- Circuit minimization problem (VK, JyC), pp. 73–79.
- STOC-2000-KaoNT #optimisation
- The risk profile problem for stock portfolio optimization (MYK, AN, SRT), pp. 228–234.
- STOC-2000-KempeKK #network
- Connectivity and inference problems for temporal networks (DK, JMK, AK), pp. 504–513.
- STOC-2000-MotwaniPSV #decidability #on the
- On the decidability of accessibility problems (RM, RP, VAS, SV), pp. 306–315.
- STOC-2000-PapadimitriouV #on the
- On the approximability of the traveling salesman problem (CHP, SV), pp. 126–133.
- TACAS-2000-LarssonPY #model checking #on the #traversal
- On Memory-Block Traversal Problems in Model-Checking Timed-Systems (FL, PP, WY), pp. 127–141.
- CL-2000-AzevedoB #constraints #modelling #set
- Modelling Digital Circuits Problems with Set Constraints (FA, PB), pp. 414–428.
- CL-2000-HolldoblerS #calculus #diagrams #using
- Solving the Entailment Problem in the Fluent Calculus Using Binary Decision Diagrams (SH, HPS), pp. 747–761.
- CL-2000-LoncT #on the #semantics
- On the Problem of Computing the Well-Founded Semantics (ZL, MT), pp. 673–687.
- LICS-2000-BergmanS #algebra #complexity
- Computational Complexity of Some Problems Involving Congruences on Algebras (CB, GS), pp. 168–174.
- LICS-2000-Selman #challenge #satisfiability #testing
- Satisfiability Testing: Recent Developments and Challenge Problems (BS), p. 178.
- ICDAR-1999-StockerRL #classification #network #self
- Self-organized Classification Problem Solving with Yprel Neural Networks (ES, AR, YL), pp. 390–393.
- PODS-1999-BoassonCGM #linear #sequence
- Window-Accumulated Subsequence Matching Problem is Linear (LB, PC, IG, YM), pp. 327–336.
- PODS-1999-KarloffM #complexity #on the
- On the Complexity of the View-Selection Problem (HJK, MM), pp. 167–173.
- PODS-1999-Tygar
- Open Problems in Electronic Commerce (JDT), p. 101.
- ICSM-1999-Kajko-Mattsson #experience #maintenance #process
- Experience Paper: Maintenance at ABB (I): Software Problem Administration Processes (MKM), p. 167–?.
- DLT-1999-Anselmo
- A non-ambiguous language factorization problem (MA), pp. 141–152.
- DLT-1999-LoftusSW
- New problems of pattern avoidance (JL, JS, MwW), pp. 185–199.
- ICALP-1999-Ajtai #generative
- Generating Hard Instances of the Short Basis Problem (MA), pp. 1–9.
- ICALP-1999-DickhoferW #automaton #model checking
- Timed Alternating Tree Automata: The Automata-Theoretic Solution to the TCTL Model Checking Problem (MD, TW), pp. 281–290.
- ICALP-1999-Kirsten #finite #monad
- A Connection between the Star Problem and the Finite Power Property in Trace Monoids (DK), pp. 473–482.
- ICALP-1999-KirstenM
- Two Techniques in the Area of the Star Problem (DK, JM), pp. 483–492.
- ICALP-1999-KrauseSW #approximate
- Approximations by OBDDs and the Variable Ordering Problem (MK, PS, IW), pp. 493–502.
- ICALP-1999-Umans #complexity #on the
- On the Complexity and Inapproximability of Shortest Implicant Problems (CU), pp. 687–696.
- IFM-1999-GibsonHM #integration #requirements
- Integration Problems in Telephone Feature Requirements (JPG, GWH, DM), pp. 129–148.
- RTA-1999-BaaderT #equation #word
- Deciding the Word Problem in the Union of Equational Theories Sharing Constructors (FB, CT), pp. 175–189.
- TLCA-1999-EidorffHMNST #approach
- AnnoDomini in Practice: A Type-Theoretic Approach to the Year 2000 Problem (PHE, FH, CM, HN, MHS, MT), pp. 6–13.
- HCI-CCAD-1999-JohnsonO #learning #multi #using
- Innovative mathematical learning environments — Using multimedia to solve real world problems (LFJ, POJ), pp. 677–681.
- HCI-CCAD-1999-Swezey #metric #performance #simulation
- Measurement of team problem solving performance via a computerized quasi-experimental simulation (RWS), pp. 482–486.
- HCI-EI-1999-HartsonAWR #classification #framework #usability
- The User Action Framework: A Theory-Based Foundation for Inspection and Classification of Usability Problems (HRH, TSA, RCW, LvR), pp. 1058–1062.
- HCI-EI-1999-HennS #e-commerce #interface
- Compatibility Problems in e-Commerce Interfaces (HH, TS), pp. 571–575.
- HCI-EI-1999-LeinoRH #usability
- Computer Usability Problems and Psychological Well-being (TL, TR, PH), pp. 11–14.
- ICEIS-1999-Athans #distributed
- A Class of Distributed Decision Problems (MA), p. III.
- ICEIS-1999-MelicioCR
- Solving the Timetabling Problem with Simulated Annealing (FM, JPC, ACR), pp. 272–279.
- ICEIS-1999-PsarrasMMA #industrial #optimisation #scheduling
- Optimizing a Real-World Scheduling Problem in the Steel Industry (JEP, GM, IM, DA), p. 767.
- MLDM-1999-MilanovaAOS #network
- Applications of Celluar Neural Networks for Shape from Shading Problem (MGM, PEMA, JOJ, MGS), pp. 51–63.
- SIGIR-1999-Baumgarten #distributed #information retrieval
- A Probabilitstic Solution to the Selection and Fusion Problem in Distributed Information Retrieval (CB), pp. 246–253.
- OOPSLA-1999-France #analysis #concept #modelling #requirements #uml
- A Problem-Oriented Analysis of Basic UML Static Requirements Modeling Concepts (RBF), pp. 57–69.
- TOOLS-USA-1999-Ciupke #automation #design #detection #object-oriented #re-engineering
- Automatic Detection of Design Problems in Object-Oriented Reengineering (OC), pp. 18–32.
- TOOLS-USA-1999-Lilly #case study #using
- Use Case Pitfalls: Top 10 Problems from Real Projects Using Use Cases (SL), pp. 174–183.
- PADL-1999-CadoliPSV #execution #named #specification
- NP-SPEC: An Executable Specification Language for Solving All Problems in NP (MC, LP, AS, DV), pp. 16–30.
- SIGAda-1999-RusanovaK #distributed #parallel #scheduling
- Scheduling problems for parallel and distributed systems (OR, AK), pp. 195–201.
- ASE-1999-Biggerstaff
- Fixing Some Transformation Problems (TJB), pp. 148–157.
- ICSE-1999-OssherT #development #evolution #object-oriented #programming #using
- Using Subject-Oriented Programming to Overcome Common Problems in Object-Oriented Software Development/Evolution (HO, PLT), pp. 687–688.
- SAC-1999-Haynes #adaptation #combinator #distributed #optimisation
- Distributed Collective Adaptation Applied to Hard Combinatorial Optimization Problem (TH), pp. 339–343.
- SAC-1999-JinH #array #clustering
- False Sharing Problems in Cluster-Based Disk Arrays (HJ, KH), pp. 461–465.
- SAC-1999-KatayamaN #algorithm #search-based #using
- A New Iterated Local Search Algorithm Using Genetic Crossover for the Traveling Salesman Problem (KK, HN), pp. 302–306.
- SAC-1999-Raidl #algorithm #multi #search-based
- A Weight-Coded Genetic Algorithm for the Multiple Container Packing Problem (GRR), pp. 291–296.
- SAC-1999-Rivera-Gallego #algorithm #distance #matrix #search-based
- A Genetic Algorithm for Solving the Euclidean Distance Matrices Completion Problem (WRG), pp. 286–290.
- DAC-1999-DasdanIG #algorithm #performance
- Efficient Algorithms for Optimum Cycle Mean and Optimum Cost to Time Ratio Problems (AD, SI, RKG), pp. 37–42.
- DAC-1999-QuWP
- Optimization-Intensive Watermarking Techniques for Decision Problems (GQ, JLW, MP), pp. 33–36.
- DATE-1999-MaestroMH #approach #hardware
- The Heterogeneous Structure Problem in Hardware/Software Codesign: A Macroscopic Approach (JAM, DM, RH), pp. 766–767.
- HPDC-1999-LigonMS #multi
- Spatially Decomposed Multigrain MOM Problems on NOWs (WBLI, AQM, DCSJ), pp. 149–155.
- PDP-1999-MontoyaGG #algorithm #image #segmentation
- Load balancing for a class of irregular and dynamic problems: region growing image segmentation algorithms (MDGM, CG, IG), pp. 163–169.
- PDP-1999-Vajtersic #algorithm #scalability
- A scalable VLSI algorithm for the fourth-order elliptic problem (MV), pp. 53–57.
- PDP-1999-YeroH #internet #parallel #scalability
- A method to solve the scalability problem in managing massively parallel processing on the Internet (EJHY, MAAH), pp. 256–262.
- FoSSaCS-1999-BogaertST #automaton
- The Recognizability Problem for Tree Automata with Comparisons between Brothers (BB, FS, ST), pp. 150–164.
- STOC-1999-AroraK #approximate #latency
- Approximation Schemes for Minimum Latency Problems (SA, GK), pp. 688–693.
- STOC-1999-BeameF #bound
- Optimal Bounds for the Predecessor Problem (PB, FEF), pp. 295–304.
- STOC-1999-BorodinOR #bound #nearest neighbour
- Lower Bounds for High Dimensional Nearest Neighbor Search and Related Problems (AB, RO, YR), pp. 312–321.
- STOC-1999-BorodinOR99a #algorithm #approximate #clustering
- Subquadratic Approximation Algorithms for Clustering Problems in High Dimensional Spaces (AB, RO, YR), pp. 435–444.
- STOC-1999-CharikarGTS #algorithm #approximate
- A Constant-Factor Approximation Algorithm for the k-Median Problem (MC, SG, ÉT, DBS), pp. 1–10.
- STOC-1999-FederHKM #complexity #graph
- Complexity of Graph Partition Problems (TF, PH, SK, RM), pp. 464–472.
- STOC-1999-FerraginaMB #approach #geometry #multi #string
- Multi-Method Dispatching: A Geometric Approach With Applications to String Matching Problems (PF, SM, MdB), pp. 483–491.
- STOC-1999-GoelHPT #data transfer #network #scheduling #set
- Scheduling Data Transfers in a Network and the Set Scheduling Problem (AG, MRH, SAP, ÉT), pp. 189–197.
- STOC-1999-GuruswamiKRSY #algorithm #approximate
- Near-Optimal Hardness Results and Approximation Algorithms for Edge-Disjoint Paths and Related Problems (VG, SK, RR, FBS, MY), pp. 19–28.
- STOC-1999-Indyk #algorithm #metric #sublinear
- Sublinear Time Algorithms for Metric Space Problems (PI), pp. 428–434.
- STOC-1999-PanC #complexity #matrix
- The Complexity of the Matrix Eigenproblem (VYP, ZQC), pp. 507–516.
- STOC-1999-SchulmanV #approximate
- Majorizing Estimators and the Approximation of #P-Complete Problems (LJS, VVV), pp. 288–294.
- STOC-1999-Zwick99a #programming
- Outward Rotations: A Tool for Rounding Solutions of Semidefinite Programming Relaxations, with Applications to MAX CUT and Other Problems (UZ), pp. 679–687.
- TACAS-1999-Heljanko #concurrent #logic programming #petri net #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.
- CADE-1999-Pichler #equation
- Solving Equational Problems Efficiently (RP), pp. 97–111.
- ICLP-1999-MomiglianoP #higher-order
- The Relative Complement Problem for Higher-Order Patterns (AM, FP), pp. 380–394.
- ICLP-1999-TickYM #constraints
- Finding Fair Allocations for the Coalition Problem with Constraints (ET, RHCY, MJM), pp. 530–544.
- LICS-1999-Friedman #complexity
- Some Decision Problems of Enormous Complexity (HF), pp. 2–12.
- LICS-1999-Johannsen #bound
- Weak Bounded Arithmetic, the Diffie-Hellman Problem and Constable’s Class K (JJ), pp. 268–274.
- PODS-1998-BaileyDR #database #decidability #termination
- Decidability and Undecidability Results for the Termination Problem of Active Database Rules (JB, GD, KR), pp. 264–273.
- PODS-1998-KolaitisMT #complexity #on the #query
- On the Complexity of the Containment Problem for Conjunctive Queries with Built-in Predicates (PGK, DLM, MNT), pp. 197–204.
- VLDB-1998-FlorescuLS #database #question
- Is Web-site Management a Database Problem? (DF, AYL, DS), p. 696.
- VLDB-1998-RezendeH #case study #database #experience #middleware #performance
- The Heterogeneity Problem and Middleware Technology: Experiences with and Performance of Database Gateways (FdFR, KH), pp. 146–157.
- ITiCSE-1998-Ellis #development #internet #learning #multi #using
- Group 1 (working group): development and use of multimedia and Internet resources for a problem based learning environment (AE), p. 269.
- ITiCSE-1998-Marneffe #algorithm
- The problem of examination questions in algorithmics (PAdM), pp. 74–76.
- CSMR-1998-KawabeMUO #classification
- Variable Classification Technique and Application to the Year 2000 Problem (KK, AM, SU, AO), pp. 44–51.
- ICSM-1998-YangLZ #abstraction #approach #re-engineering #reverse engineering
- Tackling the Abstraction Problem for Reverse Engineering in a System Re-engineering Approach (HY, XL, HZ), pp. 284–293.
- ICALP-1998-AkutsuY #biology #complexity #on the
- On the Complexity of Deriving Score Functions from Examples for Problems in Molecular Biology (TA, MY), pp. 832–843.
- ICALP-1998-BazganST #algorithm #approximate #performance #similarity
- Efficient Approximation Algorithms for the Subset-Sums Equality Problem (CB, MS, ZT), pp. 387–396.
- ICALP-1998-HusfeldtR
- Hardness Results for Dynamic Problems by Extensions of Fredman and Saks’ Chronogram Method (TH, TR), pp. 67–78.
- RTA-1998-DershowitzT #database #online
- An On-line Problem Database (ND, RT), pp. 332–342.
- RTA-1998-Levy #decidability #higher-order #unification
- Decidable and Undecidable Second-Order Unification Problems (JL), pp. 47–60.
- RTA-1998-VermaRL #algorithm #reduction
- Algorithms and Reductions for Rewriting Problems (RMV, MR, DL), pp. 166–180.
- CHI-1998-AbowdABEGL #education #integration #ubiquitous
- Investigating the Capture, Integration and Access Problem of Ubiquitous Computing in an Educational Setting (GDA, CGA, JAB, TE, PG, JL), pp. 440–447.
- ICML-1998-Cesa-BianchiF #bound #finite #multi
- Finite-Time Regret Bounds for the Multiarmed Bandit Problem (NCB, PF), pp. 100–108.
- ICML-1998-WeissH
- The Problem with Noise and Small Disjuncts (GMW, HH), p. 574–?.
- ICPR-1998-Duin #analysis #relational #scalability
- Relational discriminant analysis and its large sample size problem (RPWD), pp. 445–449.
- ICPR-1998-Kwok #classification
- Support vector mixture for classification and regression problems (JTYK), pp. 255–258.
- ICPR-1998-OkataniD #identification #invariant #on the #using
- On identification of singular points using photometric invariants for global shape from shading problem (TO, KD), pp. 1787–1790.
- ICPR-1998-Shevlin #analysis #using
- Analysis of orientation problems using Plucker lines (FS), pp. 685–689.
- KDD-1998-LingL #data mining #mining
- Data Mining for Direct Marketing: Problems and Solutions (CXL, CL), pp. 73–79.
- KR-1998-Mani #formal method
- A Theory of Granularity and its Application to Problems of Polysemy and Underspecification of Meaning (IM), pp. 245–257.
- ECOOP-1998-MikhajlovS #case study
- A Study of The Fragile Base Class Problem (LM, ES), pp. 355–382.
- ALP-PLILP-1998-Aoto #persistent #term rewriting
- Solution to the Problem of Zantema on a Persistent Property of Term Rewriting Systems (TA), pp. 250–265.
- ALP-PLILP-1998-LimetS #framework
- A General Framework for R-Unification Problems (SL, FS), pp. 266–281.
- SAS-1998-GoyalP
- A New Solution to the Hidden Copy Problem (DG, RP), pp. 327–348.
- FSE-1998-DisneyJ #quality
- Investigation Data Quality Problems in the PSP (AMD, PMJ), pp. 143–152.
- ICSE-1998-GruhnU #case study #experience #industrial #modelling #process
- Software Process Modeling and Enactment: An Experience Report Related to Problem Tracking in an Industrial Project (VG, JU), pp. 13–21.
- ICSE-1998-SimH #case study #how
- The Ramp-Up Problem in Software Projects: A Case Study of How Software Immigrants Naturalize (SES, RCH), pp. 361–370.
- SAC-1998-CappJ #algorithm #search-based
- A weight-coded genetic algorithm for the minimum weight triangulation problem (KC, BAJ), pp. 327–331.
- SAC-1998-HarandiR #classification #distributed
- Classification and organizational issues in distributed problem solving (MTH, GR), pp. 65–69.
- SAC-1998-KangH #algorithm #graph transformation #search-based #using
- Solving the rural postman problem using a genetic algorithm with a graph transformation (MJK, CGH), pp. 356–360.
- SAC-1998-Kimm #2d #configuration management #pipes and filters
- Two dimensional maximal elements problem on a reconfigurable optical pipelined bus system (HK), pp. 623–627.
- SAC-1998-Marchiori98a #algorithm #clique #heuristic #search-based
- A simple heuristic based genetic algorithm for the maximum clique problem (EM), pp. 366–373.
- SAC-1998-Nemer-PreeceW #algorithm #parallel #satisfiability #search-based
- Parallel genetic algorithm to solve the satisfiability problem (NNP, RWW), pp. 23–28.
- DAC-1998-ZhongAMM #case study #configuration management #satisfiability #using
- Using Reconfigurable Computing Techniques to Accelerate Problems in the CAD Domain: A Case Study with Boolean Satisfiability (PZ, PA, SM, MM), pp. 194–199.
- DATE-1998-HelvigRZ #approximate #bound
- Improved Approximation Bounds for the Group Steiner Problem (CSH, GR, AZ), pp. 406–413.
- DATE-1998-LubaszewskiCC #approach #testing
- Microsystems Testing: an Approach and Open Problems (ML, ÉFC, BC), pp. 524–528.
- DATE-1998-MartinezAQH
- A Dynamic Model for the State Assignment Problem (MM, MJA, JMQ, JLH), pp. 835–839.
- HPCA-1998-AbramsonLPR
- FPGA Based Custom Computing Machines for Irregular Problems (DA, PL, AP, MR), pp. 324–333.
- ISMM-1998-JohnstoneW #memory management #question
- The Memory Fragmentation Problem: Solved? (MSJ, PRW), pp. 26–36.
- PDP-1998-BadiaV #divide and conquer #parallel #symmetry
- Exploiting the parallel divide-and-conquer method to solve the symmetric tridiagonal eigenproblem (JMB, AMV), pp. 13–19.
- STOC-1998-Ajtai #np-hard #random #reduction
- The Shortest Vector Problem in L2 is NP-hard for Randomized Reductions (MA), pp. 10–19.
- STOC-1998-Arora #np-hard
- The Approximability of NP-hard Problems (SA), pp. 337–348.
- STOC-1998-AroraRR #approximate
- Approximation Schemes for Euclidean k-Medians and Related Problems (SA, PR, SR), pp. 106–113.
- STOC-1998-BlumKRV
- Semi-Definite Relaxations for Minimum Bandwidth and other Vertex-Ordering Problems (AB, GK, RR, SV), pp. 100–105.
- STOC-1998-GoldreichG #on the
- On the Limits of Non-Approximability of Lattice Problems (OG, SG), pp. 1–9.
- STOC-1998-HuangR #algebra #approach #black box #composition #set
- A Black Box Approach to the Algebraic Set Decomposition Problem (MDAH, AJR), pp. 497–506.
- STOC-1998-Kleinberg #algorithm
- Decision Algorithms for Unsplittable Flow and the Half-Disjoint Paths Problem (JMK), pp. 530–539.
- STOC-1998-KleinbergPR #segmentation
- Segmentation Problems (JMK, CHP, PR), pp. 473–482.
- STOC-1998-NatanzonSS #algorithm #approximate #polynomial
- A Polynomial Approximation Algorithm for the Minimum Fill-In Problem (AN, RS, RS), pp. 41–47.
- ISSTA-1998-StocksRLZ #context-sensitive grammar
- Comparing Flow and Context Sensitivity on the Modification-Side-Effects Problem (PS, BGR, WL, SZ), pp. 21–31.
- LICS-1998-ComonNNR #order
- Decision Problems in Ordered Rewriting (HC, PN, RN, MR), pp. 276–286.
- LICS-1998-KolaitisO #bound #first-order #logic #on the
- On the Boundedness Problem for Two-Variable First-Order Logic (