Informationen zu | Englisch Wort COMPUTATIONALLY

Beispiele für die Verwendung von COMPUTATIONALLY in einem Satz

• The first type of setup is class-level setup in which a computationally expensive object, such as a database connection, is created and reused, with minimal side effects.
• These calculations include systematically applied approximations intended to make calculations computationally feasible while still capturing as much information about important contributions to the computed wave functions as well as to observable properties such as structures, spectra, and thermodynamic properties.
• In computability theory, a system of data-manipulation rules (such as a model of computation, a computer's instruction set, a programming language, or a cellular automaton) is said to be Turing-complete or computationally universal if it can be used to simulate any Turing machine (devised by English mathematician and computer scientist Alan Turing).
• At that time they proposed the general concept of a "trap-door one-way function", a function whose inverse is computationally infeasible to calculate without some secret "trap-door information"; but they had not yet found a practical example of such a function.
• Although this process is more computationally intensive than directly modifying the original content, changing the edits themselves can be almost instantaneous, and it prevents further generation loss as the audio, video, or image is edited.
• Due to many forms of static analysis being computationally undecidable, the mechanisms for performing it may not always terminate with the correct answer.
• Cramer's rule, implemented in a naive way, is computationally inefficient for systems of more than two or three equations.
• Computational archaeology may include the use of geographical information systems (GIS), especially when applied to spatial analyses such as viewshed analysis and least-cost path analysis as these approaches are sufficiently computationally complex that they are extremely difficult if not impossible to implement without the processing power of a computer.
• A waypoint is a point or place on a route or line of travel, a stopping point, an intermediate point, or point at which course is changed, In modern terms, it most often refers to coordinates which specify one's position on the globe at the end of each "leg" (stage) of an air flight or sea passage, the generation and checking of which are generally done computationally (with a computer or other programmed device).
• Factorization is thought to be a computationally difficult problem, whereas primality testing is comparatively easy (its running time is polynomial in the size of the input).
• In comparison to these, Levinson recursion (particularly split Levinson recursion) tends to be faster computationally, but more sensitive to computational inaccuracies like round-off errors.
• In practice, Wilson's theorem is useless as a primality test because computing (n − 1)! modulo n for large n is computationally complex, and much faster primality tests are known (indeed, even trial division is considerably more efficient).
• Since the mathematical problems stemming from nontrivial fleet scheduling easily become computationally unsolvable, the PONTIFEX idea consisted in a seamless merge of algorithms and heuristic knowledge embedded in rules.
• In 1992, Kosaka and Kak published FINALE, which is considered to be a computationally efficient and highly robust approach to vision-based navigation by indoor mobile robots.
• These methods rely on the fact that finding two large primes and multiplying them together (resulting in a semiprime) is computationally simple, whereas finding the original factors appears to be difficult.
• Waveguides such as acoustic tubes are three-dimensional, but because their lengths are often much greater than their cross-sectional area, it is reasonable and computationally efficient to model them as one-dimensional waveguides.
• Higher branching factors make algorithms that follow every branch at every node, such as exhaustive brute force searches, computationally more expensive due to the exponentially increasing number of nodes, leading to combinatorial explosion.
• This rules out functions like the SWIFFT function, which can be rigorously proven to be collision-resistant assuming that certain problems on ideal lattices are computationally difficult, but, as a linear function, does not satisfy these additional properties.
• PFMs can be experimentally determined from SELEX experiments or computationally discovered by tools such as MEME using hidden Markov models.
• It is impossible to computationally verify informational completeness of a representation unless the notion of a physical object is defined in terms of computable mathematical properties and independent of any particular representation.

Die Seitenvorbereitung dauerte: 677,79 ms.