Milestones in Computer Science and Information TechnologyBloomsbury Academic, 2003. aug. 30. - 380 oldal Using the same approach as the popular Milestones in Science and Technology and Milestones in Health and Medicine, this unique reference features more than 600 concise entries describing the most significant advances in the field of computer science and information technology. Arranged in a convenient A-to-Z format, entries explain topics in a wide variety of categories, including hardware, software, theory, mathematics, programming, languages, memory, architecture, applications, and graphics. |
Részletek a könyvből
1 - 3 találat összesen 64 találatból.
... running time or memory space needed increases as n , some measure of prob- lem size , increases . For example , in sorting , the problem size is the number of objects to be placed in order . A very good sorting algorithm runs in O ( n ) ...
... running other pro- grams ( or none at all ) in the foreground ( see Multitasking ) . So either the PC wastes those ... running cooperative computing project is the Search for Extra - Terrestrial Intelligence ( SETI ) run by the ...
... running time that is proportional to the square of the problem size ( number of signal values to be transformed ) , but in 1965 , John Tukey and James Cooley published an equiva- lent algorithm called the Fast Fourier Trans- form ( FFT ) ...
Tartalomjegyzék
Listing of Cited References | 283 |
Classification of Articles | 297 |
Chronological Index | 343 |
Copyright | |
1 további fejezet nem látható