No results for "Category:Waste minimisation" (auto) in titles.

Suggestions for article titles:

1. Minimisation (psychology): Minimisation or minimization is a type of deception involving denial coupled with rationalisation/rationalization in situations where complete denial is implausible. It is the opposite of exaggeration. (Philosophy) [100%] 2023-11-04 [Cognitive biases] [Error]...
2. Minimisation (clinical trials): Minimisation is a method of adaptive stratified sampling that is used in clinical trials, as described by Pocock and Simon. The aim of minimisation is to minimise the imbalance between the number of patients in each treatment group over a ... (Medicine) [100%] 2023-12-13 [Clinical research] [Design of experiments]...
3. Minimization: Minimization problems arise in many contexts, usually in connection with optimization: a mathematical model describes phenomena as functions of variable parameters x, and a single measure of quality F(x), the objective function, is defined, whose maximum (or the minimum ... [91%] 2023-12-13 [W.Krisher and R.Bock] [Data analysis]...
4. Minification (programming): Minification (also minimisation or minimization) is the process of removing all unnecessary characters from the source code of interpreted programming languages or markup languages without changing its functionality. These unnecessary characters usually include white space characters, new line characters, comments ... (Programming) [83%] 2024-05-24 [Source code] [JavaScript]...
5. Envy minimization: In computer science and operations research, the envy minimization problem is the problem of allocating discrete items among agents with different valuations over the items, such that the amount of envy is as small as possible. Ideally, from a fairness ... [64%] 2023-10-24 [Optimization algorithms and methods]
6. DFA minimization: In automata theory (a branch of theoretical computer science), DFA minimization is the task of transforming a given deterministic finite automaton (DFA) into an equivalent DFA that has a minimum number of states. Here, two DFAs are called equivalent if ... [64%] 2023-12-13 [Finite automata]
7. Bend minimization: In graph drawing styles that represent the edges of a graph by polylines (sequences of line segments connected at bends), it is desirable to minimize the number of bends per edge (sometimes called the curve complexity) or the total number ... (Graph drawing with few edge bends) [64%] 2023-12-14 [Graph drawing]
8. Data minimization: Data minimization is the principle of collecting, processing and storing only the necessary amount of personal information required for a specific purpose. The principle emanates from the realisation that processing unnecessary data is creating unnecessary risks for the data subject ... (Processing only necessary personal information) [64%] 2024-06-14 [Internet] [Data security]...
9. Expenditure minimization problem: In microeconomics, the expenditure minimization problem is the dual of the utility maximization problem: "how much money do I need to reach a certain level of happiness?". This question comes in two parts. [52%] 2023-12-22 [Consumer theory] [Optimal decisions]...
10. Cost-minimization analysis: Cost-minimization is a tool used in pharmacoeconomics to compare the cost per course of treatment when alternative therapies have demonstrably equivalent clinical effectiveness. Therapeutic equivalence (including adverse reactions, complications and duration of therapy) must be referenced by the author ... (Finance) [52%] 2023-09-14 [Costs] [Health care quality]...
11. Expenditure minimization problem: In microeconomics, the expenditure minimization problem is the dual of the utility maximization problem: "how much money do I need to reach a certain level of happiness?". This question comes in two parts. [52%] 2024-01-08 [Consumer theory] [Optimal decisions]...
12. Cost-minimization analysis: Cost-minimization is a tool used in pharmacoeconomics to compare the cost per course of treatment when alternative therapies have demonstrably equivalent clinical effectiveness. Therapeutic equivalence (including adverse reactions, complications and duration of therapy) must be referenced by the author ... [52%] 2023-12-12 [Costs] [Health economics]...
13. Automata, minimization of: Minimization of the parameter values of automata which results in equivalent and, in a sense, optimal automata. The problem of minimization of automata arises during the synthesis of automata, and its specific nature will depend on the approach adopted in ... (Mathematics) [52%] 2023-12-12
14. Phase dispersion minimization: Phase dispersion minimization (PDM) is a data analysis technique that searches for periodic components of a time series data set. It is useful for data sets with gaps, non-sinusoidal variations, poor time coverage or other problems that would make ... [52%] 2023-12-13 [Time series] [Nonlinear time series analysis]...
15. Phase dispersion minimization: Phase dispersion minimization (PDM) is a data analysis technique that searches for periodic components of a time series data set. It is useful for data sets with gaps, non-sinusoidal variations, poor time coverage or other problems that would make ... [52%] 2023-12-13 [Time series] [Nonlinear time series analysis]...
16. Human maximisation test: The Human maximisation test (HMT) is a test method for testing for contact allergens. It was first developed by Albert Kligman in 1966 and updated by Kligman and William Epstein in 1975. [48%] 2024-02-19 [Allergology]
17. Minimization of an area: The problem of finding the minimum of the area $ A ( F ) $ of a Riemann surface to which a given domain $ B $ of the $ z $-plane is mapped by a one-to-one regular function $ F $ of a given class $ R ... (Mathematics) [45%] 2023-10-17
18. Boolean functions, minimization of: A representation of Boolean functions by normal forms (cf. Boolean functions, normal forms of) that are most simple relative to some measure of complexity. (Mathematics) [45%] 2023-10-12
19. Maximization and minimization of functions: of a finite number of variables The problem of finding the extrema of a function $ f ( x) $, $ x= ( x ^ {1} \dots x ^ {n} ) \in X \subseteq \mathbf R ^ {n} $. This means 1) finding $ \overline{f}\; = \sup _ {x \in X ... (Mathematics) [40%] 2023-12-13