Tag #lookahead
18 papers:
- CSL-2017-FokkinkG #composition
- Precongruence Formats with Lookahead through Modal Decomposition (WJF, RJvG), p. 20.
- ICALP-v2-2015-Klein0 #game studies #how #infinity #question
- How Much Lookahead is Needed to Win Infinite Games? (FK, MZ), pp. 452–463.
- CSL-2015-Klein0 #game studies #what
- What are Strategies in Delay Games? Borel Determinacy for Games with Lookahead (FK, MZ), pp. 519–533.
- LATA-2011-Schluter #automaton
- Restarting Automata with Auxiliary Symbols and Small Lookahead (NS), pp. 499–510.
- CSL-2011-FridmanLZ #game studies #infinity
- Degrees of Lookahead in Context-free Infinite Games (WF, CL, MZ), pp. 264–276.
- DLT-2010-Schluter #automaton #on the
- On Lookahead Hierarchies for Monotone and Deterministic Restarting Automata with Auxiliary Symbols (NS), pp. 440–441.
- PDP-2010-BittencourtSM #algorithm #graph #scheduling #using
- DAG Scheduling Using a Lookahead Variant of the Heterogeneous Earliest Finish Time Algorithm (LFB, RS, ERMM), pp. 27–34.
- FoSSaCS-2010-HoltmannKT #game studies #infinity
- Degrees of Lookahead in Regular Infinite Games (MH, LK, WT), pp. 252–266.
- DAC-2009-ChoudhuryM #logic #optimisation #using
- Timing-driven optimization using lookahead logic circuits (MRC, KM), pp. 390–395.
- LCTES-2009-HinesPGWT #behaviour
- Guaranteeing instruction fetch behavior with a lookahead instruction fetch engine (LIFE) (SRH, YP, PG, DBW, GST), pp. 119–128.
- CIAA-2006-GalvezSF #bound #linear #parsing
- Shift-Resolve Parsing: Simple, Unbounded Lookahead, Linear Time (JFG, SS, JF), pp. 253–264.
- CAV-2006-GopanR
- Lookahead Widening (DG, TWR), pp. 452–466.
- STOC-2004-MankuNW #network #power of #random
- Know thy neighbor’s neighbor: the power of lookahead in randomized P2P networks (GSM, MN, UW), pp. 54–63.
- ICLP-2004-YouH
- Arc-Consistency + Unit Propagation = Lookahead (JHY, GH), pp. 314–328.
- SAT-2001-Berre #power of
- Exploiting the real power of unit propagation lookahead (DLB), pp. 59–80.
- ICML-1993-RagavanR #concept #learning
- Lookahead Feature Construction for Learning Hard Concepts (HR, LAR), pp. 252–259.
- PDP-1993-KalanteryWWR #network #parallel #simulation
- Exploiting lookahead in parallel simulation of SS7 telecommunication networks (NK, SCW, DRW, APR), pp. 324–329.
- DAC-1979-Foster #multi
- A “lookahead” router for multilayer printed wiring boards (JCF), pp. 486–493.