-
1 pessimistic simulation algorithm
песимістичний алгоритм моделювання (що знаходить разом з реальними несправностями і неіснуючі несправності, змагання сигналів і т.д.)English-Ukrainian dictionary of microelectronics > pessimistic simulation algorithm
-
2 algorithm
- aim algorithm
- automatic placement and routing algorithm
- backward error recovery algorithm
- best path algorithm
- bit-map oriented spatial processing algorithm
- block-oriented algorithm
- branch and bound algorithm
- channel algorithm
- D algorithm
- deductive algorithm
- discard algorithm
- exact embedding algorithm
- expansion algorithm
- fast-Fourier-transform algorithm
- graph-based algorithm
- Gummel’s algorithm
- hidden-line algorithm
- image processing algorithm
- iterative algorithm
- Lee algorithm
- min-cut algorithm
- modified Lee algorithm
- N-step algorithm
- one-direction algorithm
- pessimistic simulation algorithm
- random-search algorithm
- repair-most algorithm
- Roth’s D algorithm
- routing algorithm
- Schonhage algorithm
- selective-trace algorithm
- sequential algorithm
- stable sorting algorithm
- star algorithm
- table-driven algorithm
- 9-value D- algorithm
- wiring algorithmEnglish-Ukrainian dictionary of microelectronics > algorithm
См. также в других словарях:
Simulation software — is based on the process of imitating a real phenomenon with a set of mathematical formulas. It is, essentially, a program that allows the user to observe an operation through simulation without actually running the program. Simulation software is … Wikipedia
Algorithm — Flow chart of an algorithm (Euclid s algorithm) for calculating the greatest common divisor (g.c.d.) of two numbers a and b in locations named A and B. The algorithm proceeds by successive subtractions in two loops: IF the test B ≤ A yields yes… … Wikipedia
Algorithm examples — This article Algorithm examples supplements Algorithm and Algorithm characterizations. = An example: Algorithm specification of addition m+n =Choice of machine model:This problem has not been resolved by the mathematics community. There is no… … Wikipedia
Genetic algorithm — A genetic algorithm (GA) is a search heuristic that mimics the process of natural evolution. This heuristic is routinely used to generate useful solutions to optimization and search problems. Genetic algorithms belong to the larger class of… … Wikipedia
Constraint algorithm — In mechanics, a constraint algorithm is a method for satisfying constraints for bodies that obey Newton s equations of motion. There are three basic approaches to satisfying such constraints: choosing novel unconstrained coordinates ( internal… … Wikipedia
Gillespie algorithm — The Gillespie algorithm generates a statistically correct trajectory (possible solution) of a stochastic equation. It was developed and published by Dan Gillespie in 1977 to simulate chemical or biochemical systems of reactions efficiently and… … Wikipedia
Hardware-in-the-loop simulation — Hardware in the loop (HIL) simulation is a technique that is used in the development and test of complex real time embedded systems. HIL simulation provides an effective platform by adding the complexity of the plant under control to the test… … Wikipedia
Electronic circuit simulation — uses mathematical models to replicate the behavior of an actual electronic device or circuit. Simulation software allows for modeling of circuit operation and is an invaluable analysis tool. Due to its highly accurate modeling capability, many… … Wikipedia
Demon algorithm — The demon algorithm is a Monte Carlo method for efficiently sampling members of a microcanonical ensemble with a given energy. An additional degree of freedom, called the demon , is added to the system and is able to store and provide energy. If… … Wikipedia
Flexible Architecture for Simulation and Testing — The FAST Project is a new hybrid hardware prototyping platform enabled by integrating a variety of hardware components on a printed circuit board (PCB) to implement Chip Multiprocessor (CMP) or Multiprocessor (MP) systems. The Flexible… … Wikipedia
A* search algorithm — In computer science, A* (pronounced A star ) is a best first, graph search algorithm that finds the least cost path from a given initial node to one goal node (out of one or more possible goals). It uses a distance plus cost heuristic function… … Wikipedia