💡 Words with a Similar Meaning to "Interval scheduling"
Found via reverse dictionary — words that share a conceptual meaning.
| Word | Definition |
|---|---|
| flow-shop scheduling | an optimization problem in computer science and operations research. |
| job-shop scheduling | Job-shop scheduling, the job-shop problem or job-shop scheduling problem is an optimization problem in computer science and operations research. |
| computational problem | In theoretical computer science, a computational problem is one that asks for a solution in terms of an algorithm. |
| complexity classnoun | (computational complexity theory) A set of computational problems of related resource-based complexity. |
| time complexitynoun | (computer science) The amount of time an algorithm requires to run, as a function of the amount of input, measured in such a way as to ignore constant terms and multiplication by constant terms. |
| lattice problem | In computer science, lattice problems are a class of optimization problems related to mathematical objects called lattices. |
| discrete optimization | a branch of optimization in applied mathematics and computer science. |
| genetic algorithm scheduling | — |
| cycle detection | In computer science, cycle detection or cycle finding is the algorithmic problem of finding a cycle in a sequence of iterated function values. |
| algorithmnoun | (countable) A collection of ordered steps that solve a mathematical problem. A precise step-by-step plan for a computational procedure that possibly begins with an input value and yields an output value in a finite number of steps. |
| penalty method | Penalty methods are a certain class of algorithms for solving constrained optimization problems. |
| quadratic programming | the process of solving certain mathematical optimization problems involving quadratic functions. |
| interior-point method | Interior-point methods (also referred to as barrier methods or IPMs) are algorithms for solving linear and non-linear convex optimization problems. |
| augmented lagrangian method | Augmented Lagrangian methods are a certain class of algorithms for solving constrained optimization problems. |
| process calculus | In computer science, the process calculi (or process algebras) are a diverse family of related approaches for formally modelling concurrent systems. |
| odds algorithm | In decision theory, the odds algorithm (or Bruss algorithm) is a mathematical method for computing optimal strategies for a class of problems that belong to the domain of optimal stopping problems. |
| search problem | In the mathematics of computational complexity theory, computability theory, and decision theory, a search problem is a type of computational problem represented by a binary relation. |
| computational complexity theorynoun | (mathematics, computer science) A theory focusing on classifying computational problems according to their resource usage, and relating these classes to each other. |
| optimization problemnoun | (mathematics) The problem of finding the "best" solution from all feasible solutions, given constraints defining which of the solutions are feasible, and a goal function defining which of the feasible solutions is the best one. |
| transition system | In theoretical computer science, a transition system is a concept used in the study of computation. |
Translate “Interval scheduling” into Another Language
Pick a language — the word will be pre-filled in the translator.