Open Access. Powered by Scholars. Published by Universities.®
- Institution
-
- Singapore Management University (9004)
- China Simulation Federation (3880)
- TÜBİTAK (3106)
- Wright State University (2694)
- Purdue University (2077)
-
- Old Dominion University (1995)
- Missouri University of Science and Technology (1926)
- University of Nebraska - Lincoln (1739)
- Edith Cowan University (1285)
- Air Force Institute of Technology (1277)
- University of Texas at El Paso (1174)
- Kennesaw State University (1161)
- Dartmouth College (1102)
- San Jose State University (1053)
- City University of New York (CUNY) (956)
- Embry-Riddle Aeronautical University (949)
- Washington University in St. Louis (830)
- Brigham Young University (823)
- Technological University Dublin (816)
- California Polytechnic State University, San Luis Obispo (788)
- Zayed University (677)
- University of Texas at Arlington (666)
- University for Business and Technology in Kosovo (637)
- Portland State University (625)
- Chulalongkorn University (618)
- Nova Southeastern University (577)
- New Jersey Institute of Technology (571)
- Syracuse University (531)
- University of Nebraska at Omaha (497)
- University of Central Florida (490)
- Keyword
-
- Machine learning (1663)
- Artificial intelligence (1017)
- Deep learning (1002)
- Machine Learning (755)
- Computer Science (702)
-
- Security (648)
- Cybersecurity (556)
- Artificial Intelligence (483)
- Deep Learning (432)
- Computer science (412)
- Privacy (410)
- Simulation (391)
- Technical Reports (390)
- UTEP Computer Science Department (389)
- Classification (374)
- Algorithms (356)
- Optimization (352)
- Computer vision (349)
- Neural networks (345)
- Data mining (337)
- AI (298)
- Natural language processing (292)
- Department of Computer Science and Engineering (291)
- Engineering (269)
- Education (268)
- Reinforcement learning (259)
- Blockchain (255)
- Cloud computing (255)
- College for Professional Studies (253)
- Software engineering (252)
- Publication Year
- Publication
-
- Research Collection School Of Computing and Information Systems (8459)
- Journal of System Simulation (3880)
- Turkish Journal of Electrical Engineering and Computer Sciences (3106)
- Theses and Dissertations (2731)
- Department of Computer Science Technical Reports (1721)
-
- Computer Science & Engineering Syllabi (1312)
- Computer Science Faculty Publications (927)
- Departmental Technical Reports (CS) (914)
- Computer Science Faculty Research & Creative Works (907)
- Master's Projects (859)
- Computer Science Technical Reports (772)
- The R Journal (708)
- All Computer Science and Engineering Research (683)
- All Works (675)
- Faculty Publications (663)
- C-Day Computing Showcase (653)
- Chulalongkorn University Theses and Dissertations (Chula ETD) (618)
- Dissertations (568)
- Electronic Theses and Dissertations (567)
- Kno.e.sis Publications (542)
- Journal of Digital Forensics, Security and Law (536)
- CCAC Theses and Dissertations (512)
- Walden Dissertations and Doctoral Studies (469)
- Computer Science Faculty Publications and Presentations (404)
- Theses (403)
- Neutrosophic Systems with Applications (375)
- USF Tampa Graduate Theses and Dissertations (374)
- Computer Science and Engineering Theses - Archive (365)
- Computer Science: Faculty Publications (364)
- Browse all Theses and Dissertations (359)
- Publication Type
Articles 62881 - 62910 of 62956
Full-Text Articles in Entire DC Network
Studies In Computational Linguistics No. 1, The Recognition Of Alphabets, Edward F. Storm
Studies In Computational Linguistics No. 1, The Recognition Of Alphabets, Edward F. Storm
Electrical Engineering and Computer Science - Technical Reports
Formal parsing rules for programming languages often have machinery for recognizing identifiers, numerical constants, and other substrings whose internal structure is only marginally relevant to the language structure as a whole. In this note alphabets are introduced in which identifiers, constants, etc. are regarded as single symbols. An alphabet is thus constructed out of a finite set of characters, is identified as a regular language and a simple recognition algorithm is described, giving the language designer considerable latitude in his choice of alphabet.
A Note On "Axioms" For Computational Complexity And Computation Of Finite Functions, Paul R. Young
A Note On "Axioms" For Computational Complexity And Computation Of Finite Functions, Paul R. Young
Department of Computer Science Technical Reports
No abstract provided.
Terminal Talk - The Wofford Connection - February 1970, Wofford College Computer Center
Terminal Talk - The Wofford Connection - February 1970, Wofford College Computer Center
Terminal Talk
No abstract provided.
Terminal Talk - The Wofford Connection - January 1970, Wofford College Computer Center
Terminal Talk - The Wofford Connection - January 1970, Wofford College Computer Center
Terminal Talk
No abstract provided.
Opset Program For Computerized Selection Of Watershed Parameter Values For The Stanford Watershed Model, Earnest Yuan-Shang Liou, L. Douglas James
Opset Program For Computerized Selection Of Watershed Parameter Values For The Stanford Watershed Model, Earnest Yuan-Shang Liou, L. Douglas James
KWRRI Research Reports
The advent of high-speed electronic computer made it possible to model complex hydrologic processes by mathematical expressions and thereby simulate streamflows from climatological data. The most widely used program is the Stanford Watershed Model, a digital parametric model of the land phase of the hydrologic cycle based on moisture accounting processes. It can be used to simulate annual or longer flow sequences at hourly time intervals. Due to its capability of simulating historical streamflows from recorded climatological data, it has a great potential in the planning and design of water resources systems. However, widespread use of the Stanford Watershed Model …
The Assignment Problem And A Suboptimal Solution Technique, William Barry Gregory
The Assignment Problem And A Suboptimal Solution Technique, William Barry Gregory
Masters Theses
"A technique is presented which finds a fast suboptimal solution to the assignment problem. This same technique is then applied to two large dynamic programming problems for which the optimal solution is not known. These examples illustrate how easily this technique can be applied and that it is better than most optimizing techniques because it is fast, cheap and only minor hand calculations are needed. The effect of different initial solutions and their value are compared and it is found that the initial solution is not as significant in a suboptimal technique as in an optimizing technique. The initial solution …
Developing An Optical Scanner Card For Computerized Football Scouting, Curtis Lowell Byrnes
Developing An Optical Scanner Card For Computerized Football Scouting, Curtis Lowell Byrnes
All Master's Theses
The purpose of this study is to develop an optical scanner scouting card to use in conjunction with the computer for football scouting.
Modified Method Of Linear Associative Retrieval, James Donald Byrd
Modified Method Of Linear Associative Retrieval, James Donald Byrd
Masters Theses
"It is becoming increasingly important for those in decision making positions to have the most current and accurate data possible as related to their particular needs. Although there are several well known retrieval techniques available an intensified effort is being made at many installations to provide a retrieval system that will supply the demands of their own needs. One well known approach to the solution of information retrieval is linear associative retrieval. The solution that has been proposed requires several computer runs on some requests and therefore is very time consuming. The author has implemented a method to eliminate unnecessary …
Terminal Talk - The Wofford Connection - December 1969, Wofford College Computer Center
Terminal Talk - The Wofford Connection - December 1969, Wofford College Computer Center
Terminal Talk
No abstract provided.
Terminal Talk - The Wofford Connection - November 1969, Wofford College Computer Center
Terminal Talk - The Wofford Connection - November 1969, Wofford College Computer Center
Terminal Talk
No abstract provided.
Manipulation Of Data Structure In A Numerical Analysis Problem Solving Systems, Lawrence R. Symes
Manipulation Of Data Structure In A Numerical Analysis Problem Solving Systems, Lawrence R. Symes
Department of Computer Science Technical Reports
No abstract provided.
Terminal Talk - The Wofford Connection - October 1969, Wofford College Computer Center
Terminal Talk - The Wofford Connection - October 1969, Wofford College Computer Center
Terminal Talk
No abstract provided.
A Note On The Free Distance Of A Convolutional Code, Alexander Miczo
A Note On The Free Distance Of A Convolutional Code, Alexander Miczo
Electrical Engineering and Computer Science - Technical Reports
A counterexample to a conjecture on the number of constraint lengths required to achieve the free distance of a rate l/n systematic convolutional code is presented.
Terminal Talk - The Wofford Connection - September 1969, Wofford College Computer Center
Terminal Talk - The Wofford Connection - September 1969, Wofford College Computer Center
Terminal Talk
No abstract provided.
Terminal Talk - The Wofford Connection - August 1969, Wofford College Computer Center
Terminal Talk - The Wofford Connection - August 1969, Wofford College Computer Center
Terminal Talk
No abstract provided.
A Note On Dense And Nondense Families Of Complexity Classes, Paul R. Young
A Note On Dense And Nondense Families Of Complexity Classes, Paul R. Young
Department of Computer Science Technical Reports
No abstract provided.
A Translation Grammar For Algol 68, Victor B. Schneider
A Translation Grammar For Algol 68, Victor B. Schneider
Department of Computer Science Technical Reports
No abstract provided.
Terminal Talk - The Wofford Connection - July 1969, Wofford College Computer Center
Terminal Talk - The Wofford Connection - July 1969, Wofford College Computer Center
Terminal Talk
No abstract provided.
Generalized Threshold Decoding Of Convolutional Codes, Luther D. Rudolph
Generalized Threshold Decoding Of Convolutional Codes, Luther D. Rudolph
Electrical Engineering and Computer Science - Technical Reports
It is shown that any rate l/b systematic convolutional code over GF(p) can be decoded up to its minimum distance with respect to the decoding constraint length by a one-step threshold decoder. It is further shown that this decoding method can be generalized in a natural way to allow “decoding” of a received sequence in its unquantized analog form.
Terminal Talk - The Wofford Connection - June 1969, Wofford College Computer Center
Terminal Talk - The Wofford Connection - June 1969, Wofford College Computer Center
Terminal Talk
No abstract provided.
The Degree Of Convergence For Entire Functions, John R. Rice
The Degree Of Convergence For Entire Functions, John R. Rice
Department of Computer Science Technical Reports
No abstract provided.
A Comparison Of Some Numerical Integration Programs, J. Casaletto, M. Pickett, John R. Rice
A Comparison Of Some Numerical Integration Programs, J. Casaletto, M. Pickett, John R. Rice
Department of Computer Science Technical Reports
No abstract provided.
Terminal Talk - The Wofford Connection - May 1969, Wofford College Computer Center
Terminal Talk - The Wofford Connection - May 1969, Wofford College Computer Center
Terminal Talk
No abstract provided.
Terminal Talk - The Wofford Connection - May 1969, Wofford College Computer Center
Terminal Talk - The Wofford Connection - May 1969, Wofford College Computer Center
Terminal Talk
No abstract provided.
A Mathematical Problem Solving Language And Its Interpreter, Lawrence R. Symes
A Mathematical Problem Solving Language And Its Interpreter, Lawrence R. Symes
Department of Computer Science Technical Reports
No abstract provided.
Smoothing And Estimation Derivatives Of Equispaced Data, J. J. Casaletto, John R. Rice
Smoothing And Estimation Derivatives Of Equispaced Data, J. J. Casaletto, John R. Rice
Department of Computer Science Technical Reports
No abstract provided.
Terminal Talk - The Wofford Connection - April 1969, Wofford College Computer Center
Terminal Talk - The Wofford Connection - April 1969, Wofford College Computer Center
Terminal Talk
No abstract provided.
A Set Of 74 Test Functions For Nonlinear Equation Solvers, John R. Rice
A Set Of 74 Test Functions For Nonlinear Equation Solvers, John R. Rice
Department of Computer Science Technical Reports
No abstract provided.
Terminal Talk - The Wofford Connection - March 1969, Wofford College Computer Center
Terminal Talk - The Wofford Connection - March 1969, Wofford College Computer Center
Terminal Talk
No abstract provided.
Terminal Talk - The Wofford Connection - February 1969, Wofford College Computer Center
Terminal Talk - The Wofford Connection - February 1969, Wofford College Computer Center
Terminal Talk
No abstract provided.