Stem replac$ (all stems)

146 papers:

ICALP-v1-2015-LiP #fibonacci

Replacing Mark Bits with Randomness in Fibonacci Heaps (JL, JP), pp. 886–897.

ICGT-2015-DrewesHM #parsing #predict #top-down

Predictive Top-Down Parsing for Hyperedge Replacement Grammars (FD, BH, MM), pp. 19–34.

CSCW-2015-MatthiesenB #development #framework #legacy #perspective #why

Why Replacing Legacy Systems Is So Hard in Global Software Development: An Information Infrastructure Perspective (SM, PB), pp. 876–890.

ICML-2015-DingZSMM #consistency

Yinyang K-Means: A Drop-In Replacement of the Classic K-Means with Consistent Speedup (YD, YZ, XS, MM, TM), pp. 579–587.

SAC-2015-LeeKKE #algorithm #architecture #hybrid #memory management #named

M-CLOCK: migration-optimized page replacement algorithm for hybrid DRAM and PCM memory architecture (ML, DK, JK, YIE), pp. 2001–2006.

DATE-2014-PrenatPLGJDSPN #logic #power management

Magnetic memories: From DRAM replacement to ultra low power logic chips (GP, GdP, CL, OG, KJ, BD, RCS, ILP, JPN), p. 1.

ICGT-2014-RidderR #morphism #problem

The Subgraph Isomorphism Problem on a Class of Hyperedge Replacement Languages (HNdR, NdR), pp. 192–206.

ICPR-2014-ChenLLYH #adaptation #detection #forensics

Anti-forensics of JPEG Detectors via Adaptive Quantization Table Replacement (CC, HL, WL, RY, JH), pp. 672–677.

SAC-2014-YooLB #memory management #policy

The least-dirty-first cache replacement policy for phase-change memory (SY, EL, HB), pp. 1449–1454.

CC-2014-SurendranBZS #array #using

Inter-iteration Scalar Replacement Using Array SSA Form (RS, RB, JZ, VS), pp. 40–60.

CGO-2014-StadlerWM #analysis #java

Partial Escape Analysis and Scalar Replacement for Java (LS, TW, HM), p. 165.

HPDC-2014-GerofiSHTI #memory management #named #novel #policy

CMCP: a novel page replacement policy for system level hierarchical memory management on many-cores (BG, AS, AH, MT, YI), pp. 73–84.

DATE-2013-Rodriguez-RodriguezCCPT #memory management #performance #policy #using

Reducing writes in phase-change memory environments by using efficient cache replacement policies (RRR, FC, DC, LP, FT), pp. 93–96.

CSMR-2013-AbebeT #automation #identifier

Automated Identifier Completion and Replacement (SLA, PT), pp. 263–272.

ECOOP-2013-Xu #adaptation #java #named

CoCo: Sound and Adaptive Replacement of Java Collections (G(X), pp. 1–26.

SAC-OOPS-J-2009-BettiniCD13 #flexibility #java #on the

On flexible dynamic trait replacement for Java-like languages (LB, SC, FD), pp. 907–932.

ICFP-2012-Mitchell #haskell

Shake before building: replacing make with haskell (NM), pp. 55–66.

ICPR-2012-NodariVG #artificial reality #image #privacy

Digital privacy: Replacing pedestrians from Google Street View images (AN, MV, IG), pp. 2889–2893.

RE-2012-Alexandrova #analysis #development #legacy #requirements

Business requirements analysis and development for legacy system replacement projects in government organizations (AA), pp. 337–340.

ASPLOS-2012-JaleelNSSE #named #scheduling

CRUISE: cache replacement and utility-aware scheduling (AJ, HHNa, SS, SCSJ, JSE), pp. 249–260.

LATA-2011-JansenHKN #normalisation

A Local Greibach Normal Form for Hyperedge Replacement Grammars (CJ, JH, JPK, TN), pp. 323–335.

AGTIVE-2011-DrewesHM

Contextual Hyperedge Replacement (FD, BH, MM), pp. 182–197.

SAC-2011-BruggemannA

Context-aware replacement operations for data cleaning (SB, HJA), pp. 1700–1704.

ASE-2010-GibiecCC #mining #query #towards

Towards mining replacement queries for hard-to-retrieve traces (MG, AC, JCH), pp. 245–254.

DAC-2010-HaquePJP #approach #embedded #named #performance #policy #simulation

SCUD: a fast single-pass L1 cache simulation approach for embedded processors with round-robin replacement policy (MSH, JP, AJ, SP), pp. 356–361.

DATE-2010-FacchiniMCD #3d #configuration management #memory management

An RDL-configurable 3D memory tier to replace on-chip SRAM (MF, PM, FC, WD), pp. 291–294.

DATE-2010-HaquePJP #approach #embedded #named #performance #policy #simulation

DEW: A fast level 1 cache simulation approach for embedded processors with FIFO replacement policy (MSH, JP, AJ, SP), pp. 496–501.

DATE-2010-JanapsatyaIPP #adaptation #algorithm #policy

Dueling CLOCK: Adaptive cache replacement policy based on the CLOCK algorithm (AJ, AI, JP, SP), pp. 920–925.

VLDB-2010-Martinez-PalauDL

Two-way Replacement Selection (XMP, DDS, JLLP), pp. 871–881.

ICPR-2010-MinSW #2d #automation #video

Automatic Face Replacement in Video Based on 2D Morphable Model (FM, NS, ZW), pp. 2250–2253.

DATE-2009-0002CWCXY #optimisation

Gate replacement techniques for simultaneous leakage and aging optimization (YW, XC, WW, YC, YX, HY), pp. 328–333.

ITiCSE-2009-Hislop #programming

Replacing introductory programming courses with a broader perspective on computing (GWH), p. 390.

ICSM-2009-JeffreyGG #effectiveness #fault #locality #multi #performance #using

Effective and efficient localization of multiple faults using value replacement (DJ, NG, RG), pp. 221–230.

SAS-2009-GrundR #abstract interpretation

Abstract Interpretation of FIFO Replacement (DG, JR), pp. 120–136.

SAC-2009-CeccatoTPM #orthogonal

Remote software protection by orthogonal client replacement (MC, PT, MDP, AM), pp. 448–455.

CAV-2009-KaivolaGNTWPSTFRN #execution #testing #validation #verification

Replacing Testing with Formal Verification in Intel CoreTM i7 Processor Execution Engine Validation (RK, RG, NN, AT, JW, SP, AS, CT, VF, ER, AN), pp. 414–429.

DAC-2008-DongWSXLC #3d #architecture #evaluation #memory management #ram

Circuit and microarchitecture evaluation of 3D stacking magnetic RAM (MRAM) as a universal memory replacement (XD, XW, GS, YX, HHL, YC), pp. 554–559.

ICSM-2008-JaszBGR #dependence

Static Execute After/Before as a replacement of traditional software dependencies (JJ, ÁB, TG, VR), pp. 137–146.

STOC-2008-Gavinsky #interactive #quantum

Classical interaction cannot replace a quantum message (DG), pp. 95–102.

GT-VMT-2008-MazanekM #combinator #graph #parsing

Parsing of Hyperedge Replacement Grammars with Graph Parser Combinators (SM, MM).

ICGT-2008-Dodds #logic

From Separation Logic to Hyperedge Replacement and Back (MD), pp. 484–486.

ICGT-2008-Hammoudeh #clustering #modelling #network

Modelling Clustering of Sensor Networks with Synchronised Hyperedge Replacement (MH), pp. 490–492.

ICGT-2008-MazanekMM #algorithm

An Algorithm for Hypergraph Completion According to Hyperedge Replacement Grammars (SM, SM, MM), pp. 39–53.

ICGT-2008-RiegerN #data type

Abstracting Complex Data Structures by Hyperedge Replacement (SR, TN), pp. 69–83.

LCTES-2008-ReinekeG #analysis #policy

Relative competitive analysis of cache replacement policies (JR, DG), pp. 51–60.

ISSTA-2008-JeffreyGG #fault #locality #using

Fault localization using value replacement (DJ, NG, RG), pp. 167–178.

CIAA-2007-Yli-JyraK #compilation #parallel

A New Method for Compiling Parallel Replacement Rules (AYJ, KK), pp. 320–321.

ICEIS-DISI-2007-KankaanpaaTAKTS #case study #comparative #evolution #legacy

Legacy system evolution — a comparative study of modernisation and replacement initiation factors (IK, PT, JJA, JK, TT, HS), pp. 280–287.

SAC-2007-KimKK #energy #mobile

Energy-efficient disk replacement and file placement techniques for mobile systems with hard disks (YJK, KTK, JK), pp. 693–698.

SAC-2007-KumarMS #mobile #policy

A weighted cache replacement policy for location dependent data in mobile environments (AK, MM, AKS), pp. 920–924.

DAC-2006-ChengDCW #algorithm #generative #performance #power management #reduction

A fast simultaneous input vector generation and gate replacement algorithm for leakage power reduction (LC, LD, DC, MDFW), pp. 117–120.

ITiCSE-2006-Utting #education #java #problem #programming #using

Problems in the initial teaching of programming using Java: the case for replacing J2SE with J2ME (IU), pp. 193–196.

ICSM-2006-Chikofsky

Sustain, Enhance, or Replace: Making Decisions on Systems (EJC), p. 134.

SCAM-2006-JacobsL #c #metaprogramming #semantics

SMART C: A Semantic Macro Replacement Translator for C (MJ, ECL), pp. 95–106.

ICEIS-ISAS-2006-Weghorn #internet #network

Technology for Least-Cost Network Routing via Bluetooth and its Practical Application — Replacing Internet Access through Wireless Phone Networks by BT Data Links (HW), pp. 394–402.

KR-2006-EiterFTTW #programming

Replacements in Non-Ground Answer-Set Programming (TE, MF, HT, PT, SW), pp. 340–351.

SAC-2006-DuranX #algorithm #scheduling #search-based

The effects of two replacement strategies on a genetic algorithm for scheduling jobs on computational grids (BD, FX), pp. 960–961.

SAC-2006-LeongG #policy

Improving the performances of proxy cache replacement policies by considering infrequent objects (HWL, BG), pp. 791–796.

CSL-2006-Moczydlowski #normalisation

Normalization of IZF with Replacement (WM), pp. 516–530.

DAC-2005-YuanQ #reduction

Enhanced leakage reduction Technique by gate replacement (LY, GQ), pp. 47–50.

DATE-2005-BaradaranD #algorithm #architecture #configuration management

A Register Allocation Algorithm in the Presence of Scalar Replacement for Fine-Grain Configurable Architectures (NB, PCD), pp. 6–11.

CSMR-2005-Sneed #approach #incremental #integration

An Incremental Approach to System Replacement and Integration (HMS), pp. 196–206.

ICALP-2005-RodittyZ #graph

Replacement Paths and k Simple Shortest Paths in Unweighted Directed Graphs (LR, UZ), pp. 249–260.

WICSA-2004-PostmaAW #approach #architecture #component

Component Replacement in a Long-Living Architecture: The 3RDBA Approach (AP, PA, JGW), pp. 89–100.

ICGT-2004-EhrigHPP #category theory

Adhesive High-Level Replacement Categories and Systems (HE, AH, JP, UP), pp. 144–160.

CHI-2004-MillerM #clustering

Cluster-based find and replace (RCM, AMM), pp. 57–64.

ICEIS-v4-2004-MahmoodF #case study #evaluation

Can Avatars Replace the Trainer? A Case Study Evaluation (AKM, EF), pp. 208–213.

SAC-2004-Cazzola #named #performance

SmartMethod: an efficient replacement for method (WC), pp. 1305–1309.

CC-2004-SoH

Increasing the Applicability of Scalar Replacement (BS, MWH), pp. 185–201.

ISMM-2004-Smaragdakis #adaptation #policy

General adaptive replacement policies (YS), pp. 108–119.

LICS-2004-CookT

The Strength of Replacement in Weak Arithmetic (SAC, NT), pp. 256–264.

ICEIS-v4-2003-KammanahalliSGV #policy

A Time Zone Based Dynamic Cache Replacement Policy (HK, KS, SG, SV), pp. 494–497.

CGO-2003-FinkQ #adaptation #design #evaluation #implementation

Design, Implementation and Evaluation of Adaptive Recompilation with On-Stack Replacement (SJF, FQ), pp. 241–252.

HPCA-2003-JeongD #algorithm

Cost-Sensitive Cache Replacement Algorithms (JJ, MD), pp. 327–337.

VLDB-2002-SeifertS #hybrid #multi #policy

A Multi-version Cache Replacement and Prefetching Policy for Hybrid Data Delivery Environments (AS, MHS), pp. 850–861.

ITiCSE-2002-Reges #c# #java #question

Can C# replace java in CS1 and CS2? (SR), pp. 4–8.

ICGT-2002-Klempien-Hinrichs

Hyperedge Substitution in Basic Atom-Replacement Languages (RKH), pp. 192–206.

CIKM-2002-ChangC #algorithm #integration #web

A new cache replacement algorithm for the integration of web caching and prefectching (CYC, MSC), pp. 632–634.

ICPR-v3-2002-FerriMV #adaptation #comparison #prototype

An Experimental Comparison between Consistency-Based and Adaptive Prototype Replacement Schemes (FJF, RAM, EV), pp. 41–44.

ICSM-2001-SchauerK #behaviour #metric

The Method Replacement Indicator: A Metric for Analyzing Behavioral Substitution (RS, RKK), pp. 754–764.

GCSE-2001-WashizakiF #component #distance #using

Retrieving Software Components Using Directed Replaceability Distance (HW, YF), pp. 153–162.

SAT-2001-BuningZ #satisfiability

Satisfiable Formulas Closed Under Replacement (HKB, XZ), pp. 48–58.

SIGMOD-2000-BressanGOT #approach #policy

Integrating Replacement Policies in StorM: An Extensible Approach (CLG, BCO, SB, KLT), p. 599.

CSMR-2000-KellerS #assessment #towards

Towards a Quantitative Assessment of Method Replacement (RKK, RS), pp. 141–150.

CIKM-2000-BressanGOT #framework #modelling

A Framework for Modeling Buffer Replacement Strategies (SB, CLG, BCO, KLT), pp. 62–69.

CIKM-2000-XuHLL #named #on-demand #performance #policy

SAIU: An Efficient Cache Replacement Policy for Wireless On-demand Broadcasts (JX, QH, DLL, WCL), pp. 46–53.

ASE-1999-FuchsST #first-order #logic #natural language

Controlled Natural Language Can Replace First-Order Logic (NEF, US, ST), pp. 295–298.

CSEET-1999-SikkelSW #case study #information management

Replacing a Hospital Information System: An Example of a Real-World Case Study (KS, TAMS, RLWvdW), pp. 6–15.

STOC-1999-CohenK #web

Exploiting Regularities in Web Traffic Patterns for Cache Replacement (EC, HK), pp. 109–118.

LOPSTR-1999-BertolinoEP #source code

The Replacement Operation for CCP Programs (MB, SE, CP), pp. 216–233.

SAC-1999-SonahI #adaptation #evaluation #performance

Performance Evaluation of New Adaptive Object Replacement Techniques for VOD Systems (BS, MRI), pp. 437–442.

HPCA-1999-KuoCK #message passing #named

MP-LOCKs: Replacing H/W Synchronization Primitives with Message Passing (CCK, JBC, RK), pp. 284–288.

TAGT-1998-JacquetK #approach

Node Replacement in Hypergraphs: Translating NCE Rewriting into the Pullback Approach (HJ, RKH), pp. 117–130.

TAGT-1998-KreowskiV

Redundancy and Subsumption in High-Level Replacement Systems (HJK, GV), pp. 215–227.

TAGT-1998-SkodinisW

Neighborhood-Preserving Node Replacements (KS, EW), pp. 45–58.

CIKM-1998-TungTL #mining #named #online #optimisation #using

BROOM: Buffer Replacement using Online Optimization by Mining (AKHT, YCT, HL), pp. 185–192.

SAC-1998-Hosseini-Khayat #algorithm

Replacement algorithms for object caching (SHK), pp. 90–97.

SAC-1998-KimYL #analysis #policy

Analysis of buffer replacement policies for WWW proxy (IK, HYY, JL), pp. 98–103.

STOC-1997-Irani #multi #web

Page Replacement with Multi-Size Pages and Applications to Web Caching (SI), pp. 701–710.

GG-Handbook-Vol1-DrewesKH #graph grammar

Hyperedge Replacement, Graph Grammars (FD, HJK, AH), pp. 95–162.

GG-Handbook-Vol1-EngelfrietR #graph grammar

Node Replacement Graph Grammars (JE, GR), pp. 1–94.

GG-Handbook-Vol1-Schurr #graph transformation

Programmed Graph Replacement Systems (AS), pp. 479–546.

HPCA-1997-DahlgrenL #multi

Reducing the Replacement Overhead in Bus-Based COMA Multiprocessors (FD, AL), pp. 14–23.

VLDB-1996-DarFJST #semantics

Semantic Data Caching and Replacement (SD, MJF, BÞJ, DS, MT), pp. 330–341.

LOPSTR-1996-BossiC #termination

Replacement Can Preserve Termination (AB, NC), pp. 104–129.

PEPM-1995-EtalleG

The Replacement Operation for CLP Modules (SE, MG), pp. 168–177.

CHI-1995-BradleyJ #interface #network

Replacing a Networking Interface “From Hell” (RFB, LDJ), pp. 538–545.

VLDB-1994-JohnsonS #algorithm #named #performance

2Q: A Low Overhead High Performance Buffer Management Replacement Algorithm (TJ, DS), pp. 439–450.

TAGT-1994-Bauderon #approach #generative #graph #infinity

A Category-Theoretical Approach to Vertex Replacement: The Generation of Infinite Graphs (MB), pp. 27–37.

TAGT-1994-CourcelleS #graph #set

The Obstructions of a Minor-Closed Set of Graphs Defined by Hyperedge Replacement can be Constructed (BC, GS), pp. 351–367.

TAGT-1994-DassowHT

Chain-Code Pictures and Collages Generated by Hyperedge Replacement (JD, AH, ST), pp. 412–427.

TAGT-1994-Klempien-Hinrichs #confluence #decidability #simulation

Node Replacement in Hypergrahps: Simulation of Hyperedge Replacement, and Decidability of Confluence (RKH), pp. 397–411.

CAV-1994-SinghalP #problem

The Verifiacation Problem for Safe Replaceability (VS, CP), pp. 311–323.

SIGMOD-1993-ONeilOW #algorithm #database

The LRU-K Page Replacement Algorithm For Database Disk Buffering (EJO, PEO, GW), pp. 297–306.

HCI-SHI-1993-HerrmannK #layout

Supporting Instead of Replacing the Planner — An Intelligent Assistant System for Factory Layout Planning (JH, MK), pp. 796–801.

LOPSTR-1993-BoulangerB #abstract interpretation #using

Using Abstract Interpretation for Goal Replacement (DB, MB), pp. 210–228.

CHI-1992-KurlanderF #constraints #interactive

Interactive Constraint-Based Search and Replace (DK, SF), pp. 609–618.

TRI-Ada-C-1992-Jarc #ada #pascal

Ada, Pascal’s Replacement for Introductory Courses in Computer Science (DJJ), pp. 126–134.

ALP-1992-EhrigP #algebra #equation #specification

High-Level-Replacement Systems for Equational Algebraic Specifications (HE, FPP), pp. 3–20.

DAC-1991-SoeK #logic #using

Logic Minimization using Two-column Rectangle Replacement (SS, KK), pp. 470–473.

ESEC-1991-AmadorVA #design

Dynamically Replaceable Software: A Design Method (JA, BdV, AA), pp. 210–228.

GG-1990-DrewesK

A Note on Hyperedge Replacement (FD, HJK), pp. 1–12.

GG-1990-EhrigHKP #graph grammar

From Graph Grammars to High Level Replacement Systems (HE, AH, HJK, FPP), pp. 269–291.

GG-1990-JeltschK #grammar inference

Grammatical Inference Based on Hyperedge Replacement (EJ, HJK), pp. 461–474.

GG-1990-Lautemann #automaton #composition

Tree Automata, Tree Decomposition and Hyperedge Replacement (CL), pp. 520–537.

GG-1990-Vogler #graph #polynomial

Recognizing Edge Replacement Graph Languages in Cubic Time (WV), pp. 676–687.

WAGA-1990-FengKT #evaluation #incremental #multi

Incremental Attribute Evaluation for Multiple Subtree Replacements in Structure-Oriented Environments (AF, TK, KT), pp. 192–206.

ICALP-1989-FussellRT #component

Finding Triconnected Components by Local Replacements (DSF, VR, RT), pp. 379–393.

FPCA-1989-Sestoft #parametricity

Replacing Function Parameters by Global Variables (PS), pp. 39–53.

LFP-1988-Pugh

An Improved Replacement Strategy for Function Aaching (WP), pp. 269–276.

ICALP-1987-HowellR #equivalence #reachability

Completeness Rules for Reachability, Containment, and Equivalence, with Respect to Conflict-Free Vector Replacement Systems (RRH, LER), pp. 509–520.

GG-1986-HabelK

May we introduce to you: hyperedge replacement (AH, HJK), pp. 15–26.

FPCA-1985-Wadler85 #backtracking #exception #functional #how #lazy evaluation #pattern matching

How to Replace Failure by a List of Successes: A method for exception handling, backtracking, and pattern matching in lazy functional languages (PW), pp. 113–128.

GG-1982-EhrigS #graph transformation

Church-Rosser properties for graph replacement systems with unique splitting (HE, JS), pp. 82–101.

GG-1982-HabelK #on the

On context-free gragh languages generated by edge replacement (AH, HJK), pp. 143–158.

DAC-1981-Hlynka #design

A simulator to replace wire rules for high speed computer design (AH), pp. 113–117.

ICALP-1980-AlbertW

Languages with Homomorphic Replacements (JA, LMW), pp. 19–29.

GG-1978-EhrichL #data type #specification

Constructive Specifications of Abstract Data Types by Replacements (HDE, VGL), pp. 180–191.

STOC-1977-ODonnell #combinator #equation #lisp #logic #recursion

Subtree Replacement Systems: A Unifying Theory for Recursive Equations, LISP, Lucid and Combinatory Logic (MO), pp. 295–305.

SOSP-J-1975-ChuO76 #algorithm #analysis #markov

Analysis of the PFF Replacement Algorithm via a Semi-Markov Model (WWC, HO), pp. 298–304.

SOSP-J-1975-PrieveF76 #algorithm #named

VMIN — An Optimal Variable-Space Page Replacement Algorithm (BGP, RSF), pp. 295–297.

SOSP-1975-Kain #algorithm #how

How to Evaluate Page Replacement Algorithms (RYK), pp. 1–5.

SOSP-1975-Sadeh #algorithm #analysis #fault #performance

An Analysis of the Performance of the Page Fault Frequency (PFF) Replacement Algorithm (ES), pp. 6–13.

SIGFIDET-1974-CaseyO #algorithm #database #relational

Generalized Page replacement Algorithms in a Relational Data Base (RGC, IMO), pp. 101–124.

DAC-1972-Schmidt #composition #network

Gate for gate modular replacement of combinational switching networks (DCS), pp. 331–340.

SOSP-1969-Hellerman #principle #scheduling

Complementary replacement: a meta scheduling principle (HH), pp. 43–46.