Namespaces
Variants
Views
Actions

Search results

Jump to: navigation, search
  • * Allen B. Tucker, "Computer Science Handbook", 2nd ed. CRC Press (2004) {{ISBN|158488360X}}
    1 KB (226 words) - 07:28, 14 November 2023
  • ...bounding it from above and below, that have an exact representation in the computer. Thus, each quantity is replaced by an interval containing it. Under the ar ...top"> K. Nickel (ed.) , ''Interval mathematics'' , ''Lect. notes in comp. science'' , '''29''' , Springer (1975)</TD></TR></table>
    5 KB (677 words) - 22:13, 5 June 2020
  • ...onald E.; Patashnik, Oren "Concrete mathematics: a foundation for computer science" (2nd ed.) Addison-Wesley (1994) {{ISBN|0201558025}} {{ZBL|0836.00001}}
    2 KB (239 words) - 16:50, 23 November 2023
  • ...Typical examples of complex systems are: the nervous system, the brain, a computer, a control system in human society, etc. ...others. In particular, [[Cybernetics|cybernetics]] arose as an independent science. In it a fundamental notion is that of a complex [[Control system|control s
    4 KB (532 words) - 17:22, 7 February 2011
  • ...emantics|semantical behaviours]] associated with the [[Signature (Computer Science)|signature]] $\Sigma=(S,F)$. ...braic Specification", in J. van Leeuwen: "Handbook of Theoretical Computer Science", Elsevier 1990
    8 KB (1,264 words) - 16:16, 18 February 2013
  • ...rofound changes in scientific methodology have opened new horizons for the science of mathematics at a speed without parallel during the long history of mathe ...inning" of computers and computer science. Secondly, advances in computer science have induced very vigorous developments in certain branches of mathematics.
    13 KB (2,014 words) - 20:35, 31 December 2018
  • ...ferent optimization problems (including [[dynamic programming]]), computer science, automata and formal language theory, numerical methods, [[parallel program ...> A.V. Aho, J.E. Hopcroft, J.D. Ullman, "The design and analysis of computer algorithms" , Addison-Wesley (1976)</TD></TR>
    7 KB (1,026 words) - 20:42, 16 November 2023
  • ...rence, DLT 2011, Milan, Italy, July 19-22, 2011" Lecture Notes in Computer Science '''6795''' (2011), , Springer-Verlag (2011) {{ISBN|978-3-642-22320-4}} {{DO ...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 (579 words) - 20:19, 7 November 2023
  • ...eorgia Martin, "Bounded Queries in Recursion Theory", Progress in Computer Science and Applied Logic '''16'''. Springer (1999) {{ISBN|0817639667}}</TD></TR>
    2 KB (294 words) - 07:46, 18 November 2023
  • ...trade-off between using adaptive or non-adaptive information on a parallel computer should be carried out. ...al integration on advanced computer systems" , ''Lecture Notes in Computer Science'' , '''848''' , Springer (1994) {{MR|1324342}} {{ZBL|0825.65012}} {{ZBL|090
    4 KB (650 words) - 15:07, 14 February 2020
  • ...throughs. Nevertheless, Horn clause logic is today widely used in computer science as a well understood tool. In-depth theoretical expositions of Horn clause ...rences|[a13]]], which belongs to complexity theory of theoretical computer science, [[#References|[a12]]].
    7 KB (1,111 words) - 06:59, 21 October 2016
  • ...y the existence of a general recursive function (in programming, a partial computer; in the theory of computable functions, an $ s- m- n $- As is obvious from this identity, a partial computer constructs from a program of $ m + n $
    6 KB (919 words) - 08:26, 6 June 2020
  • ...les and let $v\in B(A,X)$ be an assignement in a [[Sigma-algebra (Computer Science)|$\Sigma$-algebra]] $A$. Then $v$ <i>satisfies</i> $p$ in $A$, written as $ ...braic Specification", in J. van Leeuwen: "Handbook of Theoretical Computer Science", Elsevier 1990
    8 KB (1,390 words) - 18:36, 11 December 2020
  • ...uations and bottlenecks, computer-aided synthesis of parallel programs and computer components, etc.). It was introduced by C. Petri in the 1960s. A Petri net ..."> W. Reisig, "Petri nets" , ''EATCS Monographs on Theoretical Computer Science'' , '''4''' , Springer (1985) {{ZBL|0555.68033}}</TD></TR></table>
    6 KB (897 words) - 19:23, 16 August 2016
  • ''computer software'' ...tion of user jobs into the computer is organized; and effective use of the computer equipment is provided (see [[#References|[1]]]–[[#References|[4]]]).
    19 KB (2,814 words) - 17:16, 7 February 2011
  • ...tside mathematics are logic, linguistics and computer science. In computer science the whole issue on correctness of programs (either in the context of correc ...applications of Montague grammar" , '''1: Philosophy, framework, computer science''' , CWI (1986)</TD></TR></table>
    9 KB (1,407 words) - 19:01, 21 November 2018
  • ...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 (403 words) - 08:08, 26 November 2023
  • ..., H.J. Weinert, ''Semirings: Algebraic Theory and Applications in Computer Science'' World Scientific (1998) {{ISBN|9814495697}} {{ZBL|0934.16046}}
    2 KB (371 words) - 05:54, 15 April 2023
  • ...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

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