-
1 judg(e)ment
1) (the decision of a judge in a court of law: It looked as if he might be acquitted but the judgement went against him.) dom2) (the act of judging or estimating: Faulty judgement in overtaking is a common cause of traffic accidents.) skjønn, vurdering3) (the ability to make right or sensible decisions: You showed good judgement in choosing this method.) vurderingsevne, dømmekraft4) ((an) opinion: In my judgement, he is a very good actor.) skjønn, mening -
2 judg(e)ment
1) (the decision of a judge in a court of law: It looked as if he might be acquitted but the judgement went against him.) dom2) (the act of judging or estimating: Faulty judgement in overtaking is a common cause of traffic accidents.) skjønn, vurdering3) (the ability to make right or sensible decisions: You showed good judgement in choosing this method.) vurderingsevne, dømmekraft4) ((an) opinion: In my judgement, he is a very good actor.) skjønn, mening
См. также в других словарях:
Choosing Healthplans All Together — (CHAT) is the name given to a simulation exercise in which players decide which benefit types (e.g. hospitalization, consultations, tests, imaging, medicines, etc) they would like to include in their health insurance package, and what level of… … Wikipedia
Method of conditional probabilities — In mathematics and computer science, the probabilistic method is used to prove the existence of mathematical objects with desired combinatorial properties. The proofs are probabilistic they work by showing that a random object, chosen from some… … Wikipedia
Method of analytic tableaux — A graphical representation of a partially built propositional tableau In proof theory, the semantic tableau (or truth tree) is a decision procedure for sentential and related logics, and a proof procedure for formulas of first order logic. The… … Wikipedia
Durand–Kerner method — In numerical analysis, the Durand–Kerner method established 1960–66 and named after E. Durand and Immo Kerner, also called the method of Weierstrass, established 1859–91 and named after Karl Weierstrass, is a root finding algorithm for… … Wikipedia
Durand-Kerner method — In numerical analysis, the Durand ndash;Kerner method (established 1960 ndash;66) or method of Weierstrass (established 1859 ndash;91) is a root finding algorithm for solving polynomial equations. In other words, the method can be used to solve… … Wikipedia
Condorcet method — Part of the Politics series Electoral methods Single winner … Wikipedia
Decomposition method (constraint satisfaction) — In constraint satisfaction, a decomposition method translates a constraint satisfaction problem into another constraint satisfaction problem that is binary and acyclic. Decomposition methods work by grouping variables into sets, and solving a… … Wikipedia
Splitting circle method — In mathematics, the splitting circle method is a numerical algorithm for the numerical factorization of a polynomial and, ultimately, for finding its complex roots. It was introduced by Arnold Schönhage in his 1982 paper The fundamental theorem… … Wikipedia
Back-and-forth method — In mathematical logic, especially set theory and model theory, the back and forth method is a method for showing isomorphism between countably infinite structures satisfying specified conditions. In particular:* It can be used to prove that any… … Wikipedia
Scientific method — … Wikipedia
Finite element method — The finite element method (FEM) (sometimes referred to as finite element analysis) is a numerical technique for finding approximate solutions of partial differential equations (PDE) as well as of integral equations. The solution approach is based … Wikipedia