Stem sweep$ (all stems)

36 papers:

LCTES-2014-KimBL #concurrent #garbage collection #javascript #lightweight

Lightweight and block-level concurrent sweeping for javascript garbage collection (HK, SB, JL), pp. 155–164.

ICML-c3-2013-SeijenS

Planning by Prioritized Sweeping with Small Backups (HvS, RSS), pp. 361–369.

ISMM-2013-MorikawaUI #adaptation #garbage collection #lisp

Adaptive scanning reduces sweep time for the Lisp2 mark-compact garbage collector (KM, TU, HI), pp. 15–26.

DAC-2012-WelpKK #optimisation

Generalized SAT-sweeping for post-mapping optimization (TW, SK, AK), pp. 814–819.

ISMM-2011-VeldemaP #gpu

Iterative data-parallel mark&sweep on a GPU (RV, MP), pp. 1–10.

DLT-2008-KapoutsisKM #automaton #complexity #on the

On the Size Complexity of Rotating and Sweeping Automata (CAK, RK, TM), pp. 455–466.

ISMM-2007-GarnerBF #effectiveness #garbage collection

Effective prefetch for mark-sweep garbage collection (RG, SMB, DF), pp. 43–54.

ISMM-2007-StanchinaM #algorithm #implementation #realtime

Mark-sweep or copying?: a “best of both worlds” algorithm and a hardware-supported real-time implementation (SS, MM), pp. 173–182.

DAC-2006-ZhuKKS #satisfiability

SAT sweeping with local observability don’t-cares (QZ, NK, AK, ALSV), pp. 229–234.

ICALP-v1-2006-Kapoutsis

Small Sweeping 2NFAs Are Not Closed Under Complement (CAK), pp. 144–156.

TACAS-2004-MailundW #graph #reachability #using

Obtaining Memory-Efficient Reachability Graph Representations Using the Sweep-Line Method (TM, MW), pp. 177–191.

TACAS-2004-Schmidt #automation #generative

Automated Generation of a Progress Measure for the Sweep-Line Method (KS0), pp. 192–204.

ICPR-v4-2004-KongTWV

Coplanar Light Sweep-Surface Supported Uncalibrated Photometric Stereo (HK, EKT, JGW, RV), pp. 92–95.

ASPLOS-2004-CherHV #analysis #garbage collection #hardware

Software prefetching for mark-sweep garbage collection: hardware analysis and software redesign (CYC, ALH, TNV), pp. 199–210.

ISMM-2004-OssiaBS #concurrent #garbage collection

Mostly concurrent compaction for mark-sweep GC (YO, OBY, MS), pp. 25–36.

OOPSLA-2003-AzatchiLPP #garbage collection #on the fly

An on-the-fly mark and sweep garbage collector based on sliding views (HA, YL, HP, EP), pp. 269–281.

ICALP-2002-BrodalF

Cache Oblivious Distribution Sweeping (GSB, RF), pp. 426–438.

FME-2002-KristensenM #safety

A Generalised Sweep-Line Method for Safety Properties (LMK, TM), pp. 549–567.

TACAS-2001-ChristensenKM

A Sweep-Line Method for State Space Exploration (SC, LMK, TM), pp. 450–464.

ICML-2001-Dearden

Structured Prioritised Sweeping (RD), pp. 82–89.

POPL-2000-ChungMES

Reducing Sweep Time for a Nearly Empty Heap (YCC, SMM, KE, DS), pp. 378–389.

VLDB-1998-ArgePRSV #scalability

Scalable Sweeping-Based Spatial Join (LA, OP, SR, TS, JSV), pp. 570–581.

ISMM-1998-ColnetCZ #algorithm #compilation

Compiler Support to Customize the Mark and Sweep Algorithm (DC, PC, OZ), pp. 154–165.

ISMM-1998-HuelsbergenW #concurrent #garbage collection

Very Concurrent Mark-&-Sweep Garbage Collection without Fine-Grain Synchronization (LH, PW), pp. 166–175.

ISMM-1998-SmithM

Comparing Mostly-Copying and Mark-Sweep Conservative Collection (FS, JGM), pp. 68–78.

ICDAR-1997-ChangLP #algorithm #analysis

Line sweep thinning algorithm for feature analysis (FC, YCL, TP), pp. 123–127.

ICDAR-v1-1995-ChangCPS #algorithm

A line sweep thinning algorithm (FC, YPC, TP, TYS), pp. 227–230.

IWMM-1995-ArmstrongV #garbage collection #realtime

One Pass Real-Time Generational Mark-Sweep Garbage Collection (JLA, RV), pp. 313–322.

IWMM-1995-MaedaKITHN #garbage collection #on the fly

On-the-fly Global Garbage Collection Based on Partly Mark-Sweep (MM, HK, YI, TT, AH, JN), pp. 283–296.

IWMM-1995-Piquer #distributed #garbage collection

Indirect Mark and Sweep: A Distributed GC (JMP), pp. 267–282.

POPL-1992-Edelson #c++

A Mark-and-Sweep Collector for C++ (DRE), pp. 51–58.

LFP-1990-Zorn #garbage collection

Comparing Mark-and-Sweep and Stop-and-Copy Garbage Collection (BGZ), pp. 87–98.

STOC-1986-EdelsbrunnerG

Topologically Sweeping an Arrangement (HE, LJG), pp. 389–403.

ICALP-1981-EngelfrietF

Passes, Sweeps and Visits (JE, GF), pp. 193–207.

ICALP-1980-Berman #automaton

A Note on Sweeping Automata (PB), pp. 91–97.

STOC-1979-Sipser #automaton #bound

Lower Bounds on the Size of Sweeping Automata (MS), pp. 360–364.