Search results

Jump to navigation Jump to search

View ( | next 20) (20 | 50 | 100 | 250 | 500)
  • Antimatter
    ...imaging]] (MRI) machine, and can help doctors see things that those other machines cannot see. ...
    5 KB (898 words) - 00:12, 25 April 2016
  • Undulator
    ...mes that they travel around the synchrotron, physicists want to design new machines that throw out the electron bunches before they have a chance to spread out ...
    5 KB (784 words) - 20:07, 20 May 2016
  • Randomized Algorithms (Spring 2010)/Balls and bins
    * Distributed a number of jobs evenly among a set of machines by a random hash function. ...orst-case searching time for the hash table and the finishing time for the machines. ...
    34 KB (5,979 words) - 13:52, 20 September 2010
  • Calculus
    10 KB (1,680 words) - 20:32, 4 January 2017
  • 组合数学 (Spring 2014)/Existence problems
    Computations in Turing machines can be simulated by circuits, and any boolean function in '''P''' can be co ...
    14 KB (2,455 words) - 09:36, 2 April 2014
  • 组合数学 (Spring 2015)/Existence problems
    Computations in Turing machines can be simulated by circuits, and any boolean function in '''P''' can be co ...
    14 KB (2,455 words) - 09:37, 9 November 2015
  • 组合数学 (Fall 2019)/Existence problems
    Computations in Turing machines can be simulated by circuits, and any boolean function in '''P''' can be co ...
    14 KB (2,455 words) - 08:14, 16 October 2019
  • 组合数学 (Spring 2016)/Existence problems
    Computations in Turing machines can be simulated by circuits, and any boolean function in '''P''' can be co ...
    14 KB (2,455 words) - 03:49, 24 October 2016
  • 组合数学 (Fall 2023)/Existence problems
    Computations in Turing machines can be simulated by circuits, and any boolean function in '''P''' can be co ...
    14 KB (2,455 words) - 12:56, 18 April 2023
  • 组合数学 (Fall 2024)/Existence problems
    Computations in Turing machines can be simulated by circuits, and any boolean function in '''P''' can be co ...
    14 KB (2,455 words) - 13:27, 9 April 2024
  • 组合数学 (Spring 2013)/Existence problems
    Computations in Turing machines can be simulated by circuits, and any boolean function in '''P''' can be co ...
    14 KB (2,455 words) - 09:24, 19 April 2013
  • 组合数学 (Fall 2017)/Existence problems
    Computations in Turing machines can be simulated by circuits, and any boolean function in '''P''' can be co ...
    14 KB (2,455 words) - 02:36, 31 October 2017
  • Randomized Algorithms (Spring 2010)/Randomized approximation algorithms
    ...<math>m</math>, find an assignment of the jobs to <math>m</math> identical machines so that the completion time, also called the '''makespan''', is minimum. ...
    20 KB (3,484 words) - 05:14, 11 June 2010
  • 组合数学 (Fall 2011)/Counting and existence
    Computations in Turing machines can be simulated by circuits, and any boolean function in '''P''' can be co ...
    21 KB (3,832 words) - 15:23, 7 October 2011
  • Combinatorics (Fall 2010)/Existence, the probabilistic method
    Computations in Turing machines can be simulated by circuits, and any boolean function in '''P''' can be co ...
    26 KB (4,583 words) - 04:53, 7 October 2010
  • Randomized Algorithms (Spring 2010)/The probabilistic method
    Computations in Turing machines can be simulated by circuits, and any boolean function in '''P''' can be co ...
    33 KB (6,039 words) - 08:41, 7 June 2010
  • Quantum mechanics
    ...Thus QM explains how [[computer]]s work, because computers are electronic machines. But the designers of the early [[computer hardware]] of around 1950 or 196 ...
    36 KB (5,991 words) - 08:00, 24 August 2017
  • Rounding
    ...lar problem with Java as it is designed to be run identically on different machines, special programming tricks have had to be used to achieve this with x87 fl ...
    46 KB (7,060 words) - 01:36, 21 August 2017
View ( | next 20) (20 | 50 | 100 | 250 | 500)
Retrieved from "https://tcs.nju.edu.cn/wiki/index.php?title=Special:Search"