Search results
Results from the WOW.Com Content Network
Physics, mathematics, computer science, nonlinear sciences, quantitative biology and statistics: Repository of electronic pre-prints of papers in the fields of mathematics, physics, astronomy, computer science, quantitative biology, statistics, and quantitative finance. Free Cornell University [16] ASCE Library: Civil engineering
Dynamic problem For an initial set of N numbers, dynamically maintain the maximal one when insertion and deletions are allowed. A well-known solution for this problem is using a self-balancing binary search tree. It takes space O(N), may be initially constructed in time O(N log N) and provides insertion, deletion and query times in O(log N).
As the Collection of Computer Science Bibliographies consists of many subcollections there is a substantial overlap (roughly 1/3). At the end of 2008 there were more than 4.2 million records which represent about 2.8 million unique (in terms of normalized title and authors' last names) bibliographic entries.
In the static predecessor problem, the set of elements does not change, but in the dynamic predecessor problem, insertions into and deletions from the set are allowed. [ 1 ] The predecessor problem is a simple case of the nearest neighbor problem, and data structures that solve it have applications in problems like integer sorting .
Addison–Wesley is an American publisher of textbooks and computer literature. It is an imprint of Pearson plc, a global publishing and education company.In addition to publishing books, Addison–Wesley also distributes its technical titles through the O'Reilly Online Learning e-reference service.
Markov decision process (MDP), also called a stochastic dynamic program or stochastic control problem, is a model for sequential decision making when outcomes are uncertain. [ 1 ] Originating from operations research in the 1950s, [ 2 ] [ 3 ] MDPs have since gained recognition in a variety of fields, including ecology , economics , healthcare ...
The Computer Science Ontology (CSO) is an automatically generated taxonomy of research topics in the field of Computer Science. [ 1 ] [ 2 ] It was produced by the Open University in collaboration with Springer Nature by running an information extraction system over a large corpus of scientific articles. [ 3 ]
He anticipated later developments in first-order predicate calculus, which were crucial for the theoretical foundations of computer science. 1960 Licklider, J. C. R. Began the investigation of human–computer interaction, leading to many advances in computer interfaces as well as in cybernetics and artificial intelligence. 1987 Liskov, Barbara