lookahead


Also found in: Wikipedia.

lookahead

[′lu̇k·ə‚hed]
(computer science)
A procedure in which a processor is preparing one instruction in a computer program while executing its predecessor.
References in periodicals archive ?
Moves were selected by performing lookahead search from each current board position, with the board positions visited in each search evaluated by a "scoring polynomial," a function of features extracted from the board positions.
According to the lookahead lines for Super Bowl LIII, the Rams won't be favored against either the Kansas City Chiefs or New England Patriots.
Control I-LOS considerando la distancia lookahead constante para el seguimiento de camino curvos en AUV [2016 Convencion Cientifica de Ingenieria y Arquitectura, La Habana, Cuba].
1) at the input of the model there is a leading block with the transfer function M(p) = [e.sup.p[tau]]; where [tau]--is the lookahead time;
However, as Graeme Hirst has cautioned: "In the case of parsers with limited lookahead, the disambiguating information may be out of sight and a choice may have to be made without it." (15) While the proficient and sophisticated reader, performer or listener may be capable of retaining conflicting meanings simultaneously, and is subconsciously attuned to resolving ambiguities generated by the garden path effect, less competent and experienced language users inevitably experience greater difficulty.
Chung and Burdick (2007) also evaluated various search patterns, including: random search; sweeping search along parallel lines; 'optimal lookahead search', in which the next cell to be visited is continually updated with new information; 'saccadic search', in which search cells are visited in order of their probability of containing the search object, and; 'Drosophila-inspired search', in which search focus follows (more or less) the shortest path from the cell just searched to the next most probable cell.
It publishes the local plan (at a specific rate) with a configurable lookahead distance, and additionally, it publishes the control commands ackermann_cmd with the type ackermannDriveStamped.msg.
This block diagram (fig 4) explains about the available address like as ripple carry adder, carry lookahead adder etc.
In this paper, the performance of routing protocols for selected network and the optimum way of utilizing the network resources is proposed, unlike [9] where an exact algorithm based on the Branch and Bound principle is proposed and then improved by the Lookahead technique.
Algorithm 1: [LRTA.sup.*] with a lookahead of one: [LRTA.sup.*] ([S.sub.start], [S.sub.goal]).
Power and Performance Management via Lookahead Control