Search results

...3. |chapter=The "goodness" of small contemporary permanent magnet electric machines | date = 2003 Laithwaite showed that for a simple induction motor this gave: ...

...of varying processing times, which need to be scheduled on ''m'' identical machines, such that a certain objective function is optimized, for example, the [[ma ...eneral case, the processing time of each job may be different on different machines; in the case of identical machine scheduling, the processing time of each j ...

A [[simple machine]] that exhibits [[mechanical advantage]] is called a '''mechanical ...leading to a proportionately large mechanical advantage. This allows even simple wheels with wooden axles running in wooden blocks to still turn freely, bec ...

...Hatcliff. An Introduction to Online and Offline Partial Evaluation using a Simple Flowchart Language. In Partial Evaluation - Practice and Theory, [[DIKU]] 1 '''Reversible flow chart language''' (RL) is a simple reversible imperative programming language designed for reversible computin ...

...ority will take [[:wikt:precedence|precedence]]. It is an improvement on a simple encoder because it can handle all possible input combinations, but at the c ...23rd Annual International Symposium on Field-Programmable Custom Computing Machines |chapter=Modular SRAM-Based Binary Content-Addressable Memories |date=May 2 ...

...ate=December 9, 2015|title=Implementing functional languages with abstract machines|url=https://www.cs.bham.ac.uk/~hxt/2015/compilers/compiling-functional.pdf| ...dinary CEK machine. The CK machine has no environment, and can be used for simple calculi without variables.<ref name=":0">{{Cite web|last1=Felleisen|first1= ...

...s have no effects on a certain process. [[Photolithography|Photolitography machines]] and high precision optical instruments are some examples of application o ...is not verified, it's not possible to determine its position by using the simple geometric method shown above, and the transformation will not be a homothet ...

...tem should immediately detect this condition and provision nine additional machines from the cloud, so as to serve all web users responsively. ...astic system should immediately detect this condition and deprovision nine machines and release them to the cloud. ...

...otherwise. In [[theoretical computer science]], such always-halting Turing machines are called [[total Turing machine]]s or '''algorithms'''.{{sfnp|Sipser|1997 As noted above, every context-sensitive language is recursive. Thus, a simple example of a recursive language is the set ''L={abc, {{not a typo|aabbcc}}, ...

...mber 1989 |pages=1655–1660|doi=10.1002/pen.760292306 }}</ref> Spin welding machines consist of two tool fixtures; fixed tooling, and driven tooling. === Inertia welding machines === ...

...ns and electrons in a plasma will rotate around magnetic lines of force. A simple way to confine a plasma would be to use a [[solenoid]], a series of circula In the simple case, when the particle has completed one orbit of the reactor's major axis ...

...ker2003>J. J. Uicker, G. R. Pennock, and J. E. Shigley, 2003, '''Theory of Machines and Mechanisms,''' Oxford University Press, New York.</ref><ref>[https://bo ...special cases: (i) a simple open chain, and (ii) a simple closed chain. A simple open chain consists of <math>n</math> moving links connected end to end by ...

DBNs can be viewed as a composition of simple, unsupervised networks such as [[restricted Boltzmann machine]]s (RBMs)<ref ...l|vauthors=Fischer A, Igel C|year=2014|title=Training Restricted Boltzmann Machines: An Introduction|url=http://image.diku.dk/igel/paper/TRBMAI.pdf|journal=Pat ...

...Kl101-01 to 11. The Belgian ''[[État-Belge]]'' gave their four confiscated machines the numbers 9670, 9674, 9676 and 9686. A further eight locomotives ended up ...een handed over to Poland and France in 1918. In 1968, there were still 25 machines in working condition, but they were retired soon thereafter. ...

...|date=2014-08-01|title=On the configuration-LP for scheduling on unrelated machines|url=https://doi.org/10.1007/s10951-013-0359-4|journal=Journal of Scheduling ...small items. The dual of this LP is more complex and cannot be solved by a simple knapsack-problem separation oracle. Csirik, Johnson and Kenyon<ref name=":2 ...

...c processing-time. There is also a number ''m'' specifying the number of ''machines'' that can process the jobs. The LPT algorithm works as follows: ...alyzed by [[Ronald Graham]] in the 1960s in the context of the [[identical-machines scheduling]] problem.<ref name="Graham19692">{{cite journal|last1=Graham|fi ...

...simply because they were easy to design and understand. Generally, fusion machines using a toroidal layout, like the [[tokamak]] and most [[stellarator]]s, ar In the simple case of a plasma with up-down symmetry, the plasma cross-section is defined ...

[[File:Tm block.png|thumb|433x433px|A simple block diagram of the Tsetlin machine]] ...ine.org/about/ |access-date=2024-02-05 |website=An Introduction to Tsetlin Machines |language=en-US}}</ref> and gave the method its name after [[Michael Lvovit ...

...imitation, so they can achieve higher particle energies than electrostatic machines. The advantages of electrostatic accelerators over oscillating field machines include lower cost, the ability to produce continuous beams, and higher bea ...

...of Naval Personnel|United States Bureau of Naval Personnel]] |title=Basic machines and how they work |date=1974 |publisher=[[Dover Publications]] |isbn=978048 At the other extreme, when ''r'' is zero, the system becomes a simple [[Block and tackle#Example Block and Tackle Configurations|''gun tackle'']] ...