Open Access. Powered by Scholars. Published by Universities.®
- Institution
-
- Singapore Management University (9003)
- China Simulation Federation (3880)
- TÜBİTAK (3106)
- Wright State University (2694)
- Purdue University (2077)
-
- Old Dominion University (1996)
- Missouri University of Science and Technology (1938)
- 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 (1104)
- San Jose State University (1053)
- City University of New York (CUNY) (956)
- Embry-Riddle Aeronautical University (950)
- 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 (532)
- University of Nebraska at Omaha (497)
- University of Central Florida (490)
- Keyword
-
- Machine learning (1665)
- Artificial intelligence (1020)
- Deep learning (1003)
- Machine Learning (761)
- Computer Science (712)
-
- Security (648)
- Cybersecurity (558)
- Artificial Intelligence (484)
- Deep Learning (434)
- Computer science (412)
- Privacy (410)
- Simulation (391)
- Technical Reports (390)
- UTEP Computer Science Department (389)
- Classification (375)
- Algorithms (357)
- Optimization (352)
- Computer vision (349)
- Neural networks (345)
- Data mining (337)
- AI (301)
- Natural language processing (293)
- 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 (8458)
- Journal of System Simulation (3880)
- Turkish Journal of Electrical Engineering and Computer Sciences (3106)
- Theses and Dissertations (2733)
- Department of Computer Science Technical Reports (1721)
-
- Computer Science & Engineering Syllabi (1312)
- Computer Science Faculty Publications (928)
- Computer Science Faculty Research & Creative Works (919)
- Departmental Technical Reports (CS) (914)
- 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)
- USF Tampa Graduate Theses and Dissertations (378)
- Neutrosophic Systems with Applications (375)
- Computer Science and Engineering Theses - Archive (365)
- Computer Science: Faculty Publications (364)
- Browse all Theses and Dissertations (359)
- Publication Type
Articles 61921 - 61950 of 63035
Full-Text Articles in Entire DC Network
A Computational Framework For Constructing Adaptive Grid Domain Mappings, Calvin J. Ribbens
A Computational Framework For Constructing Adaptive Grid Domain Mappings, Calvin J. Ribbens
Department of Computer Science Technical Reports
No abstract provided.
A Comparison Of Two Evidential Reasoning Schemes, Sunny Lee
A Comparison Of Two Evidential Reasoning Schemes, Sunny Lee
Department of Computer Science Technical Reports
No abstract provided.
Planar Linear Arrangements Of Outerplanar Graphs, Greg N. Frederickson, Susanne E. Hambrusch
Planar Linear Arrangements Of Outerplanar Graphs, Greg N. Frederickson, Susanne E. Hambrusch
Department of Computer Science Technical Reports
No abstract provided.
Distributed Systems Based Upon A Functional Communication Model With A Timed Token Protocol, Dan C. Marinescu
Distributed Systems Based Upon A Functional Communication Model With A Timed Token Protocol, Dan C. Marinescu
Department of Computer Science Technical Reports
No abstract provided.
Applying Ai Techniques To Program Optimization For Parallel Computers, Ko-Yang Wang, Dennis Gannon
Applying Ai Techniques To Program Optimization For Parallel Computers, Ko-Yang Wang, Dennis Gannon
Department of Computer Science Technical Reports
No abstract provided.
Adiabatic Shearing Of Incompressible Non-Newtonian Fluids, N. C. Charalambakis, Elias N. Houstis
Adiabatic Shearing Of Incompressible Non-Newtonian Fluids, N. C. Charalambakis, Elias N. Houstis
Department of Computer Science Technical Reports
No abstract provided.
Cascading Divide-And-Conquer: A Technique For Designing Parallel Algorithms, Mikhail J. Atallah, Richard Cole, Michael T. Goodrich
Cascading Divide-And-Conquer: A Technique For Designing Parallel Algorithms, Mikhail J. Atallah, Richard Cole, Michael T. Goodrich
Department of Computer Science Technical Reports
No abstract provided.
Efficient Solutions To Some Transpsortation Problems With Applications To Minimizing Robot Arm Travel, Mikhail J. Atallah, S. Rao Kosaraju
Efficient Solutions To Some Transpsortation Problems With Applications To Minimizing Robot Arm Travel, Mikhail J. Atallah, S. Rao Kosaraju
Department of Computer Science Technical Reports
No abstract provided.
A Priori Grid Adaption Strategies For Elliptic Pdes, Calvin J. Ribbens
A Priori Grid Adaption Strategies For Elliptic Pdes, Calvin J. Ribbens
Department of Computer Science Technical Reports
No abstract provided.
Some Experiments With Tcp/Ip Protocols Over An X.25 Network, John T. Korb, Craig E. Wills
Some Experiments With Tcp/Ip Protocols Over An X.25 Network, John T. Korb, Craig E. Wills
Department of Computer Science Technical Reports
No abstract provided.
Periodic Phenomena In The Classical Adams Spectral Sequence, Mark Mahowald, Paul L. Shick
Periodic Phenomena In The Classical Adams Spectral Sequence, Mark Mahowald, Paul L. Shick
Mathematics and Computer Science
We investigate certain periodic phenomena in the classical Adams spectral sequence which are related to the polynomial generators υn in π∗(ΒΡ). We define the notion of a class α in ExtΑ(Ζ/2,Ζ/2) being υn-periodic or υn-torsion and prove that classes that are υn-torsion are also υκ-torsion for all κ such that 0 ≤ κ ≤ n. This allows us to define a chromatic filtration of ExtΑ(Ζ/2,Ζ/2) paralleling the chromatic filtration of the Novikov spectral sequence Ε2-term …
Parallel Algorithms For Line Detection On A Mesh, Concettina Guerra, Susanne E. Hambrusch
Parallel Algorithms For Line Detection On A Mesh, Concettina Guerra, Susanne E. Hambrusch
Department of Computer Science Technical Reports
No abstract provided.
Sun Workstations As Cypress Implets, Douglas E. Comer, Gregory H. Smith
Sun Workstations As Cypress Implets, Douglas E. Comer, Gregory H. Smith
Department of Computer Science Technical Reports
No abstract provided.
Parallel And Vector Problems On The Flex/32, H S. Mcfaddin, John R. Rice
Parallel And Vector Problems On The Flex/32, H S. Mcfaddin, John R. Rice
Department of Computer Science Technical Reports
No abstract provided.
A Software Metrics Survey, S. D. Conte, Herbert E. Dunsmore, V. Y. Shen, W. M. Zage
A Software Metrics Survey, S. D. Conte, Herbert E. Dunsmore, V. Y. Shen, W. M. Zage
Department of Computer Science Technical Reports
No abstract provided.
Perception Of A Quadrilaleral, Chia-Hoang Lee
Perception Of A Quadrilaleral, Chia-Hoang Lee
Department of Computer Science Technical Reports
No abstract provided.
Closed-Network Duals Of Multiques With Application To Token-Passing Systems, Vernon J. Rego, Wojciech Szpankowski
Closed-Network Duals Of Multiques With Application To Token-Passing Systems, Vernon J. Rego, Wojciech Szpankowski
Department of Computer Science Technical Reports
No abstract provided.
A New Approach To The Dynamic Maintenance Of Maximal Points In A Plane, Greg N. Frederickson, Susan Rodger
A New Approach To The Dynamic Maintenance Of Maximal Points In A Plane, Greg N. Frederickson, Susan Rodger
Department of Computer Science Technical Reports
No abstract provided.
Meta-Level Programming: A Compiled Approach, Hamid Bacha
Meta-Level Programming: A Compiled Approach, Hamid Bacha
Electrical Engineering and Computer Science - Technical Reports
There has been some intense research lately focused on the area of meta-level inference systems. In logic programming, the limitations of Prolog are widely recognized and a meta-level approach has been suggested. Unfortunately, only meta-interpreters have been considered so far. Moreover, these meta-interpreters are often themselves written on top of a Prolog interpreter. These cascaded layers of interpreters result in an enormous slow down, rendering the resulting system practically useless for all but a small number of toy applications. This paper will report on the implementation of a fast incremental metaProlog compiler. In the process, it will explore some of …
A Routing Algorithm For Three Stage Rearrangeable Clos Networks, Ralph W. Wilkerson
A Routing Algorithm For Three Stage Rearrangeable Clos Networks, Ralph W. Wilkerson
Computer Science Faculty Research & Creative Works
No abstract provided.
A Logic Programming Model Of The Game Of Sprouts, Ralph M. Butler, Selden Y. Trimble, Ralph W. Wilkerson
A Logic Programming Model Of The Game Of Sprouts, Ralph M. Butler, Selden Y. Trimble, Ralph W. Wilkerson
Computer Science Faculty Research & Creative Works
The Game of Sprouts Has Intrigued Mathematicians for Nearly Twenty Years. This Paper Describes a Representation Scheme Which Simplifies Much of the Geometry of the Game. using This Representation, We Develop a Prolog Program Which Will Play Sprouts. It is Hoped that the Program Will Prove to Be a Useful Research Tool in Finding the Key to a Winning Strategy for Sprouts and that the Representation Will Serve as a Useful Model for Studying Planar Graphs.
A Logic Programming Model Of The Game Of Sprouts, Ralph M. Butler, Selden Y. Trimble, Ralph W. Wilkerson
A Logic Programming Model Of The Game Of Sprouts, Ralph M. Butler, Selden Y. Trimble, Ralph W. Wilkerson
Computer Science Faculty Research & Creative Works
The Game of Sprouts Has Intrigued Mathematicians for Nearly Twenty Years. This Paper Describes a Representation Scheme Which Simplifies Much of the Geometry of the Game. using This Representation, We Develop a Prolog Program Which Will Play Sprouts. It is Hoped that the Program Will Prove to Be a Useful Research Tool in Finding the Key to a Winning Strategy for Sprouts and that the Representation Will Serve as a Useful Model for Studying Planar Graphs. © 1987, ACM. All Rights Reserved.
A Dynamic Caching Algorithm Based On C. C. Chang's Ordered Minimal Perfect Hashing Scheme, Thomas J. Sager
A Dynamic Caching Algorithm Based On C. C. Chang's Ordered Minimal Perfect Hashing Scheme, Thomas J. Sager
Computer Science Technical Reports
No abstract provided.
The Performance Of Numerical Methods For Elliptic Problems With Mixed Boundary Conditions, Wayne R. Dyksen, Calvin J. Ribbens, John R. Rice
The Performance Of Numerical Methods For Elliptic Problems With Mixed Boundary Conditions, Wayne R. Dyksen, Calvin J. Ribbens, John R. Rice
Department of Computer Science Technical Reports
No abstract provided.
An Experimental Implementation Of The Tilde Naming System, Douglas E. Comer, Ralph E. Droms, Thomas P. Murtagh
An Experimental Implementation Of The Tilde Naming System, Douglas E. Comer, Ralph E. Droms, Thomas P. Murtagh
Department of Computer Science Technical Reports
No abstract provided.
Lily-A Generator For Compiler Frontends, Thomas J. Sager
Lily-A Generator For Compiler Frontends, Thomas J. Sager
Computer Science Technical Reports
In this paper, LILY, a generator for compiler frontends is described. LILY uses a generator of minimal perfect hash functions, MPHF , to create small fast compilers.
A Dynamic Caching Algorithm Based On C. C. Chang's Ordered Minimal Perfect Hashing Scheme, Thomas J. Sager
A Dynamic Caching Algorithm Based On C. C. Chang's Ordered Minimal Perfect Hashing Scheme, Thomas J. Sager
Computer Science Technical Reports
An algorithm for storage and retrieval in a small dynamic cache is presented. This algorithm is based on C.C. Chang’s ordered minimal perfect hashing scheme. Our algorithm has the property that it divides the set of objects that could occupy the cache into an arbitrary number of equivalence classes. The only restriction on which objects can occupy the cache are that no two objects in the same equivalence class can be in the cache at the same time. Retrieval from the cache is performed in constant time. Update of the cache is performed in logarithmic time.
An Attribute-Grammar Implementation Of Government-Binding Theory, Nelson Correa
An Attribute-Grammar Implementation Of Government-Binding Theory, Nelson Correa
Electrical Engineering and Computer Science - All Scholarship
The syntactic analysis of languages with respect to Government binding (GB) grammar is a problem that has received relatively little attention until recently. This paper describes an attribute grammar specification of the Government binding theory. The paper focuses on the description of the attribution rules responsible for determining antecedent trace relations in phrase-structure trees, and on some theoretical implications of those rules for the GB model. The specification relies on a transformation-le variant of Government "binding theory, briefly discussed by Chomsky (1981), in which the rule move-a is replaced by an interpretive rule. Here the interpretive rule is specified by …
Sorting And Selecting In Rounds, Nicholas Pippenger
Sorting And Selecting In Rounds, Nicholas Pippenger
All HMC Faculty Publications and Research
We present upper bounds for sorting and selecting the median in a fixed number of rounds. These bounds match the known lower bounds to within logarithmic factors. They also have the merit of being “explicit modulo expansion”; that is, probabilistic arguments are used only to obtain expanding graphs, and when explicit constructions for such graphs are found, explicit algorithms for sorting and selecting will follow. Using the best currently available explicit constructions for expanding graphs, we present the best currently known explicit algorithms for sorting and selecting in rounds.
The Complexity Of Computations By Networks, Nicholas Pippenger
The Complexity Of Computations By Networks, Nicholas Pippenger
All HMC Faculty Publications and Research
We survey the current state of knowledge concerning the computation of Boolean functions by networks, with particular emphasis on the addition and multiplication of binary numbers.