Search results

Jump to navigation Jump to search
View (previous 20 | ) (20 | 50 | 100 | 250 | 500)
  • ...tion: We run <math>m\ge n</math> virtual machines over <math>n</math> real machines with the following requirements: :* each virtual machines includes exactly <math>4</math> real machines; and ...
    4 KB (681 words) - 11:49, 25 July 2013
  • :Alternating Turing machines. :Turing Machines and Class P. ...
    4 KB (441 words) - 15:12, 6 May 2020
  • We consider minimum makespan scheduling on parallel identical machines when jobs are subject to '''precedence constraints'''. ...ath>n</math> jobs <math>j=1,2,\ldots, n</math> on <math>m</math> identical machines, where job <math>j</math> has processing time <math>p_j</math>. But now a ...
    3 KB (460 words) - 08:16, 25 October 2017
  • [[File:Kraft umformende Einrichtungen..gif|thumb|Machines that multiply force.]] ...
    876 bytes (137 words) - 12:23, 12 June 2016
  • ...//hyperphysics.phy-astr.gsu.edu/hbase/mechanics/incline.html |title=Simple Machines |author= |date= |website= |publisher=Georgia State University |accessdate=1 * [[Simple machines]] ...
    4 KB (601 words) - 17:19, 21 March 2017
  • ...Hamming]] who developed it in the 1940s. At the time, Hamming worked with machines that had [[relay]]s and used [[punched card]]s to read the data. Because th ...
    2 KB (277 words) - 18:18, 3 December 2016
  • We consider minimum makespan scheduling on parallel identical machines when jobs are subject to '''precedence constraints'''. ...ath>n</math> jobs <math>j=1,2,\ldots, n</math> on <math>m</math> identical machines, where job <math>j</math> has processing time <math>p_j</math>. But now a ...
    5 KB (927 words) - 04:53, 12 October 2016
  • Suppose <math>n^2</math> jobs are assigned to <math>n</math> machines with each job choosing a machine independently and uniformly at random. Let ...
    2 KB (373 words) - 01:23, 29 June 2010
  • [[Category:Machines]] ...
    3 KB (427 words) - 02:34, 27 August 2017
  • Another number system is more common for machines. The machine number system is called the ''[[binary]]'' number system. The ...
    14 KB (2,057 words) - 01:36, 21 August 2017
  • * There are <math>m</math> identical parallel '''machines'''. Each machine can start processing jobs at time 0 and can process at mos * Each job <math>j=1,2,\ldots, n</math> must be processed on one of these machines for <math>p_j</math> time units without interruption. <math>p_j</math> is c ...
    33 KB (5,832 words) - 15:45, 19 November 2022
  • * There are <math>m</math> identical parallel '''machines'''. Each machine can start processing jobs at time 0 and can process at mos * Each job <math>j=1,2,\ldots, n</math> must be processed on one of these machines for <math>p_j</math> time units without interruption. <math>p_j</math> is c ...
    33 KB (5,832 words) - 03:44, 27 October 2017
  • * There are <math>m</math> identical parallel '''machines'''. Each machine can start processing jobs at time 0 and can process at mos * Each job <math>j=1,2,\ldots, n</math> must be processed on one of these machines for <math>p_j</math> time units without interruption. <math>p_j</math> is c ...
    33 KB (5,832 words) - 07:54, 31 October 2018
  • * There are <math>m</math> identical parallel '''machines'''. Each machine can start processing jobs at time 0 and can process at mos * Each job <math>j=1,2,\ldots, n</math> must be processed on one of these machines for <math>p_j</math> time units without interruption. <math>p_j</math> is c ...
    33 KB (5,832 words) - 05:22, 29 October 2019
  • * There are <math>m</math> identical parallel '''machines'''. Each machine can start processing jobs at time 0 and can process at mos * Each job <math>j=1,2,\ldots, n</math> must be processed on one of these machines for <math>p_j</math> time units without interruption. <math>p_j</math> is c ...
    33 KB (5,832 words) - 06:23, 29 September 2016
  • * There are <math>m</math> identical parallel '''machines'''. Each machine can start processing jobs at time 0 and can process at mos * Each job <math>j=1,2,\ldots, n</math> must be processed on one of these machines for <math>p_j</math> time units without interruption. <math>p_j</math> is c ...
    33 KB (5,832 words) - 13:15, 25 October 2020
  • * There are <math>m</math> identical parallel '''machines'''. Each machine can start processing jobs at time 0 and can process at mos * Each job <math>j=1,2,\ldots, n</math> must be processed on one of these machines for <math>p_j</math> time units without interruption. <math>p_j</math> is c ...
    33 KB (5,832 words) - 04:31, 8 November 2021
  • Many machines can be very dangerous. A machine should have a user interface that can be h ...
    4 KB (567 words) - 20:24, 10 October 2015
  • ...achines until the late 19th century (including water wheels) were reaction machines; water's ''pressure'' head acted on the machine and produced work. A react ...more economical. Pelton wheels may be either vertical or horizontal shaft machines because the size of the machine is so much less than the available head. S ...
    15 KB (2,242 words) - 18:49, 30 May 2017
  • ...ns is used in infrared technology, and much used for [[camera]]s and other machines that use visible and higher than visible radiation. This because these phot ...
    4 KB (665 words) - 07:41, 25 June 2017
View (previous 20 | ) (20 | 50 | 100 | 250 | 500)