Complexity classIn computational complexity theory, a complexity class is a set of computational problems "of related resource-based complexity". The two most commonly analyzed resources are time and memory. In general, a complexity class is defined in terms of a type of computational problem, a model of computation, and a bounded resource like time or memory. In particular, most complexity classes consist of decision problems that are solvable with a Turing machine, and are differentiated by their time or space (memory) requirements.
Genetic algorithmIn computer science and operations research, a genetic algorithm (GA) is a metaheuristic inspired by the process of natural selection that belongs to the larger class of evolutionary algorithms (EA). Genetic algorithms are commonly used to generate high-quality solutions to optimization and search problems by relying on biologically inspired operators such as mutation, crossover and selection. Some examples of GA applications include optimizing decision trees for better performance, solving sudoku puzzles, hyperparameter optimization, causal inference, etc.
Seismic tomographySeismic tomography is a technique for imaging the subsurface of the Earth with seismic waves produced by earthquakes or explosions. P-, S-, and surface waves can be used for tomographic models of different resolutions based on seismic wavelength, wave source distance, and the seismograph array coverage. The data received at seismometers are used to solve an inverse problem, wherein the locations of reflection and refraction of the wave paths are determined.
PlanarizationIn the mathematical field of graph theory, planarization is a method of extending graph drawing methods from planar graphs to graphs that are not planar, by embedding the non-planar graphs within a larger planar graph. Planarization may be performed by using any method to find a drawing (with crossings) for the given graph, and then replacing each crossing point by a new artificial vertex, causing each crossed edge to be subdivided into a path. The original graph will be represented as an immersion minor of its planarization.
Comparison sortA comparison sort is a type of sorting algorithm that only reads the list elements through a single abstract comparison operation (often a "less than or equal to" operator or a three-way comparison) that determines which of two elements should occur first in the final sorted list. The only requirement is that the operator forms a total preorder over the data, with: if a ≤ b and b ≤ c then a ≤ c (transitivity) for all a and b, a ≤ b or b ≤ a (connexity). It is possible that both a ≤ b and b ≤ a; in this case either may come first in the sorted list.
NavigabilityA body of water, such as a river, canal or lake, is navigable if it is deep, wide and calm enough for a water vessel (e.g. boats) to pass safely. Such a navigable water is called a waterway, and is preferably with few obstructions against direct traverse that needed avoiding, such as rocks, reefs or trees. Bridges built over waterways must have sufficient clearance. High flow speed may make a channel unnavigable due to risk of ship collisions. Waters may be unnavigable because of ice, particularly in winter or high-latitude regions.
WaterwayA waterway is any navigable body of water. Broad distinctions are useful to avoid ambiguity, and disambiguation will be of varying importance depending on the nuance of the equivalent word in other languages. A first distinction is necessary between maritime shipping routes and waterways used by inland water craft. Maritime shipping routes cross oceans and seas, and some lakes, where navigability is assumed, and no engineering is required, except to provide the draft for deep-sea shipping to approach seaports (channels), or to provide a short cut across an isthmus; this is the function of ship canals.
