Übersetzung für "Linear search" in Deutsch

The binary search system is superior to the linear search system with respect to the time requirement.

This takes place for example again via a linear search process.

Here reference is made to a purely linear search process for the same number of scanning beams.

This first step corresponds essentially to one origin determination at a time and is carried out sequentially in a linear search process.

This corresponds to a time savings of 5.5 ms or 73% compared to the linear search process.

Due to the large range of values for the message identifiers, there are not readily identifiable optimizations that can speed up the search, so it is typically a linear search.

When compared to the typical linear or binary search algorithm which could be used in the second stage of operation, this method saves a significant amount of CPU processing time for other processing needs.

To do this, the three-dimensionally limited action area of the scanning beam field is advantageously scanned by a combination of the principles of linear and binary search.

The time which is necessary for combined linear and binary search is however also always less than the use of the linear search process alone.

Combining the linear and binary search takes into account the circumstance that the object which is to be measured is conventionally taansported into the scanning beam field in an arbitrary orientation.

In this case, first of all using the known linear search process, the lower or the upper start of the object is determined.

Upon a call of an identifier a binary search is now possible instead of a linear search, thereby increasing the call speed once again.

The method according to claim 1, wherein the acts of searching the first database and the second database are carried out via a linear search.

The overall search time is minimal, since the two databases 16, 17 are searched by means of a linear search with a “skip” function in which parts of the list can be passed over.

By use of a data structure of this type, an search index is produced on the whole in which the respective database can be searched via a linear search so that the search for the possible destinations can be carried out with a runtime complexity of O(n).

The time required for the search can thus be reduced to a minimum in the case of a linear search.

As already explained, the search of the first and/or the second database can be carried out by means of a linear search, in particular with a skip function.

For this purpose, linear search methods, upward/downward counters or binary search methods such as successive approximation are conceivable.

This comet was identified as asteroid 1998 QP54 by G. V. Williams, Minor Planet Center. It had been reported by E. Bowell (observer W. D. Ferris, measurer B. W. Koehn) as a minor planet discovered in the course of LONEOS, the Lowell Observatory Near-Earth Object Search, LINEAR also made an observation a day after LONEOS.

A notification sound is output when running a simple linear search for a single match when that match has been found if the program is running in the background, to alert the user.

While the operating time increases in proportion to the number of scanning beams in a linear search, it increases in a binary search only in relation to the logarithm of the number of scanning beams to the base 2 .

While in a linear search the operating time is proportional to the number of scanning beams, it increases in a binary search only in relation to the logarithm of the number of scanning beams to the base 2 .