Sentence examples for a lookup process from inspiring English sources

In order to increase the feedback speed, the table is interpolated at the program start at much higher resolution and only a lookup process is performed.

The result to be sent to the DAC can be simply taken as an output value by a lookup process, or, to be more precise, the value can be interpolated from the neighbor values to get the output.

A sample lookup process, initiated with a DNS request from a stub resolver, is depicted in Figure 2. Figure 2 Sample resolution process initiated by a stub resolver for an IP address of a web site.

With respect to the associated HTs, the better the quality of the hash, the less collisions are likely to happen and, as a consequence, the lookup process will also be faster.

In particular, when HPM is combined with a broadcast mechanism, the lookup process can be significantly improved (four hops).

More in depth, Bamboo and Georoy, the two protocols considered that will be described in the following sections, retrieve resources according to a distributed mechanism where, to speed up the lookup process and make it suitable to an unreliable scenario like the one addressed by our study, a replication methodology for managing multiple copies of the same resource has been introduced.

Generally, these algorithms strive to reduce the number of required memory accesses as a means to speed up the lookup process.

We start by looking at the impact of having different number of replicas as a way to speed up the resource lookup process.

A cross-layer optimized query routing mismatch alleviation (QRMA) architecture is proposed to mitigate the problem of query routing mismatch (QRM) phenomenon between the structured peer to peer (P2P) overlay and the routing layer in mobile Ad-hoc networks (MANETs), which is an important issue that results in the inefficiency of lookup process in the system.

With the average record size and the average number of accumulated records at a First Server being S cr and N cr (defined earlier), and the number of records used by the lookup process (N l ), then the value of H a can be approximated by (N N  × N cr  + N l ) × S cr.

Then it starts the lookup process in its intra-DHT.