More specialized bicycle components may require more complex tools, including proprietary tools specific for a given manufacturer.

More direct government involvement can lead to specific areas of crony capitalism, even if the economy as a whole may be healthy.

More realistic models are tailored to a specific problem and include the transition state theory, the calculation of the potential energy surface, the Marcus theory and the Rice – Ramsperger – Kassel – Marcus ( RRKM ) theory.

More specific types are able to store many numbers represented in variables.

More specific tests for minerals include reaction to acid, magnetism, taste or smell, and radioactivity.

More recently, other more specific groups have been recognized.

( More specific terms are used for specific bodies.

More sophisticated versions may make specific desired changes to the deck's order, while still appearing to be an innocuous normal cut.

More detailed aspects include specific control of the sail's shape, e. g.:

More stringent and specific training and greater experience is required to compensate for the higher risk involved.

More data are needed to elucidate whether cardiovascular disease risks are likely to be influenced by the specific nutrients used to replace saturated fat.

More than a year after the raid, the Victorian Director of Public Prosecutions concluded that while certain offences had been committed, including criminal damage and assault with a weapon, there was insufficient evidence to charge any person with a specific offence.

More specific symptoms, which can be present in acute hepatitis from any cause, are: profound loss of appetite, aversion to smoking among smokers, dark urine, yellowing of the eyes and skin ( i. e., jaundice ) and abdominal discomfort.

The recent modern writings of Terrence Deacon and Merlin Donald, writing about the origin of language, also connect reason connected to not only language, but also mimesis, More specifically they describe the ability to create language as part of an internal modeling of reality specific to humankind.

More specific complete lattices are complete Boolean algebras and complete Heyting algebras ( locales ).

: More prince-regents ( often without such specific title ) are to be found in Regent.

More typically, the term is used in reference to systematic efforts to measure specific, relevant forms of epigenetic information such as the histone code or DNA methylation patterns.

More specific functions include " legislative drafting ", " legal aid ", " the prerogative of mercy " ( advising the President ), " liquor licensing " and " film censorship ".

* More specific meanings depending on context:

More importantly, it is possible to determine the exact amount of mixture required to fill a defined space and achieve a specific packing ratio.

More distinct terms are commonly used to denote farmers who raise specific domesticated animals.

More recent technology such as GPS and cellular networks have permitted courts to order more specific restrictions, such as permitting a registered child sex offender to leave his home at any time of day, but alerting authorities if they come within 100 metres of a school, park, or playground.

More specific uses are given below:

More localized impact scenarios – for example loss of a specific floor in a building – may also be documented.

More precisely, an algorithm is an effective method expressed as a finite list of well-defined instructions for calculating a function.

More informally, there is an algorithm that halts if u =

: More typically, solving a game means providing an algorithm that secures a win for one player, or a draw for either, against any possible moves by the opponent, from the beginning of the game.

More commonly, only the name of the library ( and not the path ) is stored in the executable, with the operating system supplying a method to find the library on-disk based on some algorithm.

More commonly, a function is defined by a formula, or ( more generally ) an algorithm — a recipe that tells how to compute the value of f ( x ) given any x in the domain.

More often than not, a particular algorithm can be specifically tailored to a particular problem, yielding better performance than a generic algorithm.

More specifically, the time for this algorithm is.

More specifically, a trait with ' good ' permanence will be reasonably invariant over time with respect to the specific matching algorithm.

More formally, a language L belongs to UP if there exists a two input polynomial time algorithm A and a constant c such that

More specifically, the running time for testing whether H is a minor of G in this case is O ( n < sup > 3 </ sup >), where n is the number of vertices in G and the big O notation hides a constant that depends superexponentially on H. Thus, by applying the polynomial time algorithm for testing whether a given graph contains any of the forbidden minors, it is possible to recognize the members of any minor-closed family in polynomial time.

More engineer-minded cranks may claim to have invented a magic compression algorithm or a perpetual motion / free energy machine.

More modern variations of tomography involve gathering projection data from multiple directions and feeding the data into a tomographic reconstruction software algorithm processed by a computer.

More complicated algorithms include the Luhn algorithm ( 1954 ), which captures 98 % of single digit transposition errors ( it does not detect 90 ↔ 09 ), while more sophisticated is the Verhoeff algorithm ( 1969 ), which catches all single digit substitution and transposition errors, and many ( but not all ) more complex errors.

) More commonly, however, the expected value ( mean or average ) of the sampled values is chosen ; this is a Bayes estimator that takes advantage of the additional data about the entire distribution that is available from Bayesian sampling, whereas a maximization algorithm such as expectation maximization ( EM ) is capable of only returning a single point from the distribution.

More precisely, the algorithm outputs an estimate for, the number of marked entries, with the following accuracy:.

More specifically, it is an open question whether a nesting depth of more than 1 is required, and if so, whether there is an algorithm to determine the minimum required star height.

More specifically, the greedy algorithm provides a factor 1 + log | V | approximation of a minimum dominating set, and show that no algorithm can achieve an approximation factor better than c log | V | for some c > 0 unless P = NP.

More specifically, a polynomial-time approximation algorithm for domatic partition with the approximation factor for a constant would imply that all problems in NP can be solved in slightly super-polynomial time.

More advanced algorithms, such as Arnoldi's algorithm and the Lanczos algorithm, save this information and use the Gram – Schmidt process or Householder algorithm to reorthogonalize them into a basis spanning the Krylov subspace corresponding to the matrix.