Namespaces
Variants
Views
Actions

Search results

Jump to: navigation, search
  • ...as Action : The Risk of Inquiry”, ''The Eleventh International Human Science Research Conference'', Oakland University, Rochester, Michigan. ...and Awbrey, J.L. (May 1991), “An Architecture for Inquiry : Building Computer Platforms for Discovery”, ''Proceedings of the Eighth International C
    9 KB (1,187 words) - 03:25, 16 June 2012
  • |81|86|90|91|92|94 = [[Category:Mathematics in science and technology]] | 68 = [[Category:Computer science]]
    5 KB (494 words) - 22:21, 4 December 2014
  • ...problem of simulating quantum systems, known to be tractable on a quantum computer, relates to the problems conventionally studied within classical computatio ...ibed above firmly established the field of quantum computation in computer science. However, it was initially unclear whether quantum computation was a physic
    15 KB (2,154 words) - 17:45, 1 July 2020
  • ...scale representation of sensory data developed by the image processing and computer vision communities. The purpose is to represent signals at multiple scales ...td valign="top">[a9]</td> <td valign="top"> "Geometry-driven diffusion in computer vision" B.M ter Haar Romeny (ed.) , Kluwer Acad. Publ. (1994)</td></tr></
    7 KB (994 words) - 15:30, 1 July 2020
  • ...APL has always been controversial. At any rate, its influence on computer science, and especially on the development of programming languages, has been consi ...lign="top"> S. Wolfram, "Mathematica: A system for doing mathematics by computer" , Addison-Wesley (1988)</TD></TR></table>
    5 KB (736 words) - 18:47, 5 April 2020
  • ...olving geometric problems. Such problems can arise from computer graphics, computer-aided design, robotics and motion planning, cartography, etc. The disciplin
    6 KB (957 words) - 17:46, 4 June 2020
  • ...en Vickers ''Topology via Logic'' Cambridge Tracts in Theoretical Computer Science '''5''' Cambridge University Press (1989) {{ISBN|0-521-36062-5}} {{ZBL|0668
    3 KB (527 words) - 07:33, 24 November 2023
  • A systematic application of the idempotent correspondence principle to computer calculations leads to a unifying approach to software and hardware design [ ...p"> A.V. Aho, J.E. Hopcroft, J.D. Ullman, "The design and analysis of computer algorithms" , Addison-Wesley (1976)</TD></TR>
    7 KB (1,079 words) - 20:39, 16 November 2023
  • ...ws interesting analogies between paths in spaces and processes in computer science, and the applicability of a range of homotopical notions. ...imensional categories and concurrency in computer science" ''Math. Struct. Computer Sci.'' , '''10''' (2000) pp. 481–524</td></tr><tr><td valign="top">[a7]</
    9 KB (1,441 words) - 17:45, 1 July 2020
  • If the behaviour of a computer program should be described formally --- this is necessary for e.g. the ve ...raic Specification", in J. van Leeuwen: "Handbook of Theoretical Computer Science", Elsevier 1990
    6 KB (890 words) - 17:31, 7 February 2013
  • $#C+1 = 4 : ~/encyclopedia/old_files/data/C024/C.0204380 Computer, abstract, A mathematical concept describing a model of a computer, while ignoring the bounded capacities of storage registers and other techn
    9 KB (1,295 words) - 17:46, 4 June 2020
  • ...on Automata, Languages, and Programming 90'' , ''Lecture Notes in Computer Science'' , '''443''' , Springer (1990) pp. 717–728</TD></TR><TR><TD valign="to
    3 KB (541 words) - 12:32, 27 August 2014
  • ...lized language|formalized language]] defined over a [[Signature (Computer Science)|signature]], a set of variables, and a logics. In this way, formulas are ...raic Specification", in J. van Leeuwen: "Handbook of Theoretical Computer Science", Elsevier 1990
    9 KB (1,594 words) - 08:40, 20 May 2013
  • ...he PRAM model has been widely used, especially by the theoretical computer science community, for designing and analyzing parallel combinatorial and graph-the ...eous resource bounds" , ''Proc. Twentieth Annual IEEE Symp. Foundations of Computer Sci., San Juan, Puerto Rico (1979)'' (1979) pp. 307–311</TD></TR></tabl
    6 KB (940 words) - 23:19, 25 November 2018
  • ...mber Theory, First Internat. Symp., ANTS-I'' , ''Lecture Notes in Computer Science'' , '''877''' , Springer (1994) pp. 1–16</TD></TR>
    3 KB (516 words) - 17:58, 8 November 2014
  • ...ithmic language]], into a language that can immediately be accepted by the computer. For certain mathematical models the translation problem has been solved ex ...ady compiled program is systematic execution, i.e. systematic testing on a computer and comparing the effects generated by the program with the expected effect
    6 KB (989 words) - 14:54, 7 June 2020
  • ...Sem. Random Graphs and Probabilistic Methods in Combinatorics and Computer Science, (Random Graphs '93; Poznań, 1993))</TD></TR>
    10 KB (1,497 words) - 06:32, 26 March 2023
  • ...on numerical methods; the main problem at that stage was to develop new, "computer-friendly" methods. In what follows the term "computational mathematics" ...matic programming|automatic programming]] the problems to be solved by the computer.
    13 KB (1,892 words) - 20:11, 31 December 2018
  • ...and moreover new method of studying them. This is the so-called method of computer simulation, which is intermediate between the classical deductive method an ...simple translation of the descriptions of the systems being modelled into computer codes. Special programs implementing the model generate the various concret
    35 KB (5,424 words) - 11:17, 26 March 2023
  • ...2006, Santa Barbara, CA, USA, June 26–29, 2006", Lecture Notes in Computer Science '''4036''' , Springer (2006) {{ISBN|3-540-35428-X}} {{ZBL|1227.68074}}
    4 KB (533 words) - 20:21, 7 November 2023

View (previous 20 | next 20) (20 | 50 | 100 | 250 | 500)