Stem restart$ (all stems)

65 papers:

CASE-2015-BergagardF #automation #on the #using

On restart of automated manufacturing systems using restart states (PB, MF), pp. 166–167.

SIGMOD-2015-ShinJSK #approach #graph #named #random #scalability

BEAR: Block Elimination Approach for Random Walk with Restart on Large Graphs (KS, JJ, LS, UK), pp. 1571–1585.

DLT-2015-OttoK #automaton #order

Deterministic Ordered Restarting Automata that Compute Functions (FO, KK), pp. 401–412.

FM-2015-Hauck-Stattelmann #behaviour #industrial

Analyzing the Restart Behavior of Industrial Control Applications (SHS, SB, BS, SK, RJ), pp. 585–588.

SIGMOD-2014-GoelCGMMHW #database #facebook #performance

Fast database restarts at facebook (AG, BC, CG, DM, JM, FUH, JLW), pp. 541–549.

VLDB-2014-YuMS #random #using

Reverse Top-k Search using Random Walk with Restart (AWY, NM, HS), pp. 401–412.

PLDI-2014-GuptaSS #execution #parallel #source code

Globally precise-restartable execution of parallel programs (GG, SS, GSS), p. 22.

CIAA-2014-Otto #automaton #bibliography

Restarting Automata for Picture Languages: A Survey on Recent Developments (FO), pp. 16–41.

LATA-2014-OttoM #automaton #order

Extended Two-Way Ordered Restarting Automata for Picture Languages (FO, FM), pp. 541–552.

FM-2014-MaricS #hardware #memory management #transaction #verification

Verification of a Transactional Memory Manager under Hardware Failures and Restarts (OM, CS), pp. 449–464.

HPDC-2014-CaoKAC

Transparent checkpoint-restart over infiniband (JC, GK, KA, GC), pp. 13–24.

CIAA-J-2012-KutribO13 #automaton #complexity #on the

On the Descriptional Complexity of the Window Size for Deleting Restarting Automata (MK, FO), pp. 831–846.

CIAA-J-2012-PrusaM13 #automaton

Restarting Tiling Automata (DP, FM), pp. 863–878.

CIAA-2013-MrazO #automaton #decidability

λ-Confluence Is Undecidable for Clearing Restarting Automata (FM, FO), pp. 256–267.

SIGIR-2013-YuL #incremental #named #random

IRWR: incremental random walk with restart (WY, XL), pp. 1017–1020.

OOPSLA-2013-ChoiNS #android #approximate #learning #testing #user interface

Guided GUI testing of android apps with minimal restart and approximate learning (WC, GCN, KS), pp. 623–640.

VLDB-2012-FujiwaraNOK #performance #random

Fast and Exact Top-k Search for Random Walk with Restart (YF, MN, MO, MK), pp. 442–453.

CIAA-2012-KutribO #automaton #complexity #on the

On the Descriptional Complexity of the Window Size for Deterministic Restarting Automata (MK, FO), pp. 253–264.

CIAA-2012-PrusaM #automaton

Restarting Tiling Automata (DP, FM), pp. 289–300.

LATA-2012-HundeshagenO #transducer

Characterizing the Rational Functions by Restarting Transducers (NH, FO), pp. 325–336.

DLT-2011-CernoM #automaton

Δ-Clearing Restarting Automata and CFL (PC, FM), pp. 153–164.

DLT-2011-HundeshagenO #automaton #regular expression

Characterizing the Regular Languages by Nonforgetting Restarting Automata (NH, FO), pp. 288–299.

LATA-2011-Schluter #automaton #lookahead

Restarting Automata with Auxiliary Symbols and Small Lookahead (NS), pp. 499–510.

SAT-2011-RamosTH

Between Restarts and Backjumps (AR, PvdT, MH), pp. 216–229.

TACAS-2010-ParizekK #component #detection #fault #java #performance #random #using

Efficient Detection of Errors in Java Components Using Random Environment and Restarts (PP, TK), pp. 451–465.

AFL-J-2008-KutribMO10 #automaton #on the

On Stateless Two-Pushdown Automata and Restarting Automata (MK, HM, FO), pp. 781–798.

CIAA-2010-HundeshagenOV #automaton

Transductions Computed by PC-Systems of Monotone Deterministic Restarting Automata (NH, FO, MV), pp. 163–172.

DLT-2010-OttoPM #automaton #on the

On Lexicalized Well-Behaved Restarting Automata That Are Monotone (FO, MP, FM), pp. 352–363.

DLT-2010-Schluter #automaton #lookahead #on the

On Lookahead Hierarchies for Monotone and Deterministic Restarting Automata with Auxiliary Symbols (Extended Abstract) (NS), pp. 440–441.

LATA-2010-PlatekML #automaton #functional #generative

Restarting Automata with Structured Output and Functional Generative Description (MP, FM, ML), pp. 500–511.

CASE-2009-AnderssonLFF #generative

Generation of restart states for manufacturing systems with discarded workpieces (KA, BL, PF, MF), pp. 191–196.

CIAA-2009-Prochazka #automaton #compilation #generative

Compiler Generator Based on Restarting Automata (JP), pp. 253–257.

LATA-2009-PardubskaPO #automaton #communication #correctness #on the #parallel

On Parallel Communicating Grammar Systems and Correctness Preserving Restarting Automata (DP, MP, FO), pp. 660–671.

HPDC-2009-HurseyML

Interconnect agnostic checkpoint/restart in open MPI (JH, TM, AL), pp. 49–58.

SAT-2009-AtseriasFT #algorithm #bound

Clause-Learning Algorithms with Many Restarts and Bounded-Width Resolution (AA, JKF, MT), pp. 114–127.

SAT-2009-HaimW #machine learning #using

Restart Strategy Selection Using Machine Learning Techniques (SH, TW), pp. 312–325.

SAT-2009-PipatsrisawatD #policy #satisfiability

Width-Based Restart Policies for Clause-Learning Satisfiability Solvers (KP, AD), pp. 341–355.

SAT-2009-SinzI #heuristic #problem

Problem-Sensitive Restart Heuristics for the DPLL Procedure (CS, MI), pp. 356–362.

AFL-2008-KutribMO #automaton #on the

On Stateless Two-Pushdown Automata and Restarting Automata (MK, HM, FO), pp. 257–268.

CSCW-2008-KuzuokaPSKYYKLH

Effect of restarts and pauses on achieving a state of mutual orientation between a human and a robot (HK, KP, YS, IK, KY, AY, YK, PL, CH), pp. 201–204.

CIKM-2008-HauglidN #database #distributed #named #query

PROQID: partial restarts of queries in distributed databases (JOH, KN), pp. 1251–1260.

SAT-2008-Biere #adaptation #satisfiability

Adaptive Restart Strategies for Conflict Driven SAT Solvers (AB), pp. 28–33.

SAT-2008-RyvchinS

Local Restarts (VR, OS), pp. 271–276.

VLDB-2007-ChaudhuriKRP #execution #query

Stop-and-Restart Style Execution for Long Running Decision Support Queries (SC, RK, RR, AP), pp. 735–745.

LATA-2007-KutribR #automaton #regular expression

Succinct Description of Regular Languages by Weak Restarting Automata (MK, JR), pp. 343–354.

LATA-2007-MesserschmidtO #automaton #nondeterminism #on the

On Determinism Versus Non-Determinism for Restarting Automata (HM, FO), pp. 413–424.

LATA-2007-MrazOP #automaton

Free Word-Order and Restarting Automata (FM, FO, MP), pp. 425–436.

CIAA-2005-JurdzinskiO #automaton #strict

Restricting the Use of Auxiliary Symbols for Restarting Automata (TJ, FO), pp. 176–187.

DLT-2004-JurdzinskiOMP #automaton #complexity #on the

On the Complexity of 2-Monotone Restarting Automata (TJ, FO, FM, MP), pp. 237–248.

DLT-2004-JurdzinskiOMP04a #automaton #on the

On Left-Monotone Deterministic Restarting Automata (TJ, FO, FM, MP), pp. 249–260.

ICALP-2004-ChrobakJST #online #scheduling

Online Scheduling of Equal-Length Jobs: Randomization and Restarts Help (MC, WJ, JS, TT), pp. 358–370.

ICSM-2003-BarrE

Safe Upgrading without Restarting (MB, SE), pp. 129–137.

DLT-2003-Otto #automaton

Restarting Automata and Their Relations to the Chomsky Hierarchy (FO), pp. 55–74.

SAC-2002-LiL #problem

Local search with annealing-like restarts to solve the vehicle routing problem with time windows (HL, AL), pp. 560–565.

SAT-2002-MonassonC #algorithm #analysis #exponential #random #satisfiability #scalability

Restart method and exponential acceleration of random 3-SAT instances resolutions: A large deviation analysis of the Davis-Putnam-Loveland-Logemann algorithm (RM, SC), p. 11.

WLC-2000-NiemannO #automaton

Further Results on Restarting Automata (GN, FO), pp. 352–369.

DLT-1999-NiemannO #automaton

Restarting automata, Church-Rosser languages, and representations of r.e. languages (GN, FO), pp. 103–114.

DLT-1997-JancarMPPV #automaton

Deleting Automata with a Restart Operation (PJ, FM, MP, MP, JV), pp. 191–202.

DLT-1997-MrazPP #automaton

Deleting Automata with a Restart Operation and Marcus Grammars (FM, MP, MP), pp. 329–342.

DLT-1995-JancarMPPV #automaton #context-free grammar

Restarting Automata, Marcus Grammars and Context-Free Languages (PJ, FM, MP, MP, JV), pp. 102–111.

VLDB-1993-Mohan #effectiveness

A Cost-Effective Method for Providing Improved Data Availability During DBMS Restart Recovery After a Failure (CM), pp. 368–379.

SIGMOD-1985-AcharyaB #database #prolog #transaction

Transaction Restarts in Prolog Database Systems (SA, GNB), pp. 364–373.

VLDB-1985-CellaryM #database #distributed #infinity

Locking with Prevention of Cyclic and Infinite Restarting in Distributed Database Systems (WC, TM), pp. 115–126.

VLDB-1975-BrowneL #database #scalability

An Optimizable Model for Application of Rollback/Restart/Recovery Procedures for Large Data Bases (JCB, GLL), pp. 508–510.

SIGFIDET-1974-Sayani #information management #transaction

Restart and Recovery in a Transaction-Oriented Information Processing System (HHS), pp. 351–366.