Stem lookahead$ (all stems)

18 papers:

ICALP-v2-2015-Klein0 #game studies #how #infinity #lookahead #question

How Much Lookahead is Needed to Win Infinite Games? (FK, MZ), pp. 452–463.

CSL-2015-Klein0 #game studies #lookahead #what

What are Strategies in Delay Games? Borel Determinacy for Games with Lookahead (FK, MZ), pp. 519–533.

ICTSS-2014-TurkerUY #adaptation #sequence

Lookahead-Based Approaches for Minimizing Adaptive Distinguishing Sequences (UCT, TÜ, HY), pp. 32–47.

LATA-2011-Schluter #automaton #lookahead

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

CSL-2011-FridmanLZ #game studies #infinity #lookahead

Degrees of Lookahead in Context-free Infinite Games (WF, CL, MZ), pp. 264–276.

FoSSaCS-2010-HoltmannKT #game studies #infinity #lookahead

Degrees of Lookahead in Regular Infinite Games (MH, LK, WT), pp. 252–266.

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.

DAC-2009-ChoudhuryM #logic #lookahead #optimisation #using

Timing-driven optimization using lookahead logic circuits (MRC, KM), pp. 390–395.

LCTES-2009-HinesPGWT #behaviour #lookahead

Guaranteeing instruction fetch behavior with a lookahead instruction fetch engine (LIFE) (SRH, YP, PG, DBW, GST), pp. 119–128.

CIAA-2006-GalvezSF #bound #linear #lookahead #parsing

Shift-Resolve Parsing: Simple, Unbounded Lookahead, Linear Time (JFG, SS, JF), pp. 253–264.

CAV-2006-GopanR #lookahead

Lookahead Widening (DG, TWR), pp. 452–466.

STOC-2004-MankuNW #lookahead #network #power of #random

Know thy neighbor’s neighbor: the power of lookahead in randomized P2P networks (GSM, MN, UW), pp. 54–63.

ICML-2004-EsmeirM #algorithm #induction

Lookahead-based algorithms for anytime induction of decision trees (SE, SM).

ICLP-2004-YouH #lookahead

Arc-Consistency + Unit Propagation = Lookahead (JHY, GH), pp. 314–328.

SAT-2001-Berre #lookahead #power of

Exploiting the real power of unit propagation lookahead (DLB), pp. 59–80.

ICML-1993-RagavanR #concept #learning #lookahead

Lookahead Feature Construction for Learning Hard Concepts (HR, LAR), pp. 252–259.

DAC-1990-Fishburn #heuristic #how #logic

A Depth-Decreasing Heuristic for Combinational Logic: Or How To Convert a Ripple-Carry Adder Into A Carry-Lookahead Adder Or Anything in-between (JPF), pp. 361–364.

DAC-1979-Foster #lookahead #multi

A “lookahead” router for multilayer printed wiring boards (JCF), pp. 486–493.