Search results
Jump to navigation
Jump to search
Page title matches
- ...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 ...11 KB (1,569 words) - 13:05, 16 December 2023
- ...n which ''p<sub>i,j</sub>'' = ''p<sub>i</sub>'' (the same run-time on all machines). ...le, the problem denoted by " '''R||'''<math>C_\max</math>" is an unrelated-machines scheduling problem with no constraints, where the goal is to minimize the m ...13 KB (2,018 words) - 11:46, 4 July 2024
- ...thus [[dimensionless]]. Since for practically all (except for the tiniest) machines the resistance of the coils is negligibly small in comparison to the reacta The [[air gap (electrical machine)|air gap]] of the machines with a [[salient pole rotor]] is quite different along the pole axis (so ca ...10 KB (1,507 words) - 19:31, 16 December 2024
- 809 bytes (131 words) - 20:34, 31 January 2018
- ...[mathematical analysis]], '''Regularization perspectives on support-vector machines''' provide a way of interpreting [[support-vector machine]]s (SVMs) in the ...|last2=Wahba |author2-link=Grace Wahba |title=Multicategory Support Vector Machines |journal=Journal of the American Statistical Association |year=2012 |volume ...10 KB (1,465 words) - 08:02, 6 June 2024
Page text matches
- # Classification of machines # Generating a binary product-machines matrix (1 if a given product requires processing in a given machine, 0 othe ...2 KB (355 words) - 05:43, 31 July 2024
- equivalence of all infinite loop space machines<ref>[https://www.ams.org/notices/199608/comm-thomason.pdf Charles Weibel, " ...math.uchicago.edu/~may/PAPERS/22.pdf The uniqueness of infinite loop space machines] ...1 KB (176 words) - 15:01, 19 July 2024
- {{Short description|RPG where users exploit processing machines}} ...enario in which multiple selfish users wish to utilize multiple processing machines. Each user has a single job, and he needs to choose a single machine to pro ...6 KB (1,085 words) - 08:16, 12 May 2023
- ...ys be simulated by exponential-time [[Turing machines|deterministic Turing machines]]. ...3 KB (416 words) - 21:47, 18 May 2023
- ...da, Mohamed G. Deciding Progress for a Class of Communicating Finite State Machines. Austin: University of Texas at Austin, 1983.</ref> The advantage of communicating finite-state machines is that they make it possible to decide many properties in communication pr ...8 KB (1,417 words) - 03:51, 26 December 2024
- ==Equivalence of Enumerator and Turing Machines== ...3 KB (580 words) - 15:21, 10 January 2025
- ...locked rotor test or stalled torque test.<ref>M.V. Deshpande, ''Electrical Machines'', p. 254, PHI Learning, 2011 {{ISBN|8120340264}}.</ref> From this test, [[ ...ght/electrical_machines/induction/parameters/params.html|title =Electrical Machines|publisher =Department of Electrical and Computer engineering, University of ...6 KB (911 words) - 03:04, 19 November 2024
- ...3. |chapter=The "goodness" of small contemporary permanent magnet electric machines | date = 2003 ...3 KB (359 words) - 18:14, 31 December 2024
- {{Characteristics of synchronous machines}} [[Category:Synchronous machines]] ...4 KB (593 words) - 06:59, 2 February 2025
- |class=[[Optimization algorithm]] for training support vector machines ...uential Minimal Optimization: A Fast Algorithm for Training Support Vector Machines ...7 KB (1,038 words) - 20:30, 1 July 2023
- ...e of the saturated{{sfn | Das | 2017 | p=493}} [[Reactances of synchronous machines#Two reactions theory|direct-axis]] [[synchronous reactance]] (in [[per-unit ...ely coupled to the grid, and its response will be slow. This increases the machines’ stability while operating on the grid, but simultaneously will increase th ...6 KB (869 words) - 08:35, 6 December 2024
- ...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 ...11 KB (1,569 words) - 13:05, 16 December 2023
- ...ic time hierarchy is the set of languages recognised by alternating Turing machines in logarithmic time with [[Random-access Turing machine|random access]] and ...1 KB (151 words) - 21:08, 27 May 2021
- If time is unlimited, the machines can run in expected exponential time — for example, keep a counter an ...ility amplification fails: Despite unbounded time, bounded error logspace machines cannot distinguish a random coin from one that lands head {{tmath|1/2+1/s(n ...4 KB (646 words) - 02:17, 30 October 2024
- ...rd edition. Addison-Wesley. {{isbn|0-321-32221-5}}. Chapter 8.6: Multitape Machines: pp 269–271 ...3 KB (497 words) - 07:49, 4 June 2024
- ...de l'eau par moyen des pompes"] (Maxims for arranging most advantageously machines intended to raise water by means of pumps), ''Mémoires de l'Académie Royale ...ont mises en mouvement par la réaction de l'eau"] (More complete theory of machines that are set in motion by reaction with water), ''Mémoires de l'Académie Ro ...5 KB (757 words) - 13:06, 6 April 2024
- ...n</sub>'' of varying processing times, which need to be scheduled on ''m'' machines with varying processing power, while trying to minimize the [[makespan]] – ...blem denoted by " '''F3|<math>p_{ij}</math>|'''<math>C_\max</math>" is a 3-machines flow-shop problem with unit processing times, where the goal is to minimize ...7 KB (1,043 words) - 09:52, 23 November 2023
- ...n which ''p<sub>i,j</sub>'' = ''p<sub>i</sub>'' (the same run-time on all machines). ...le, the problem denoted by " '''R||'''<math>C_\max</math>" is an unrelated-machines scheduling problem with no constraints, where the goal is to minimize the m ...13 KB (2,018 words) - 11:46, 4 July 2024
- ...engineering)|armature]]. Winding factor also applies to other [[electric machines]], but this article focuses on winding factor as it applies to alternators. ...l |page=7 |url=https://uotechnology.edu.iq/dep-eee/lectures/3rd/Electrical/Machines%202/I_Introduction.pdf |accessdate=August 3, 2022}}</ref> This reduction f ...5 KB (798 words) - 12:53, 14 June 2024
- ...thus [[dimensionless]]. Since for practically all (except for the tiniest) machines the resistance of the coils is negligibly small in comparison to the reacta The [[air gap (electrical machine)|air gap]] of the machines with a [[salient pole rotor]] is quite different along the pole axis (so ca ...10 KB (1,507 words) - 19:31, 16 December 2024