Open Access. Powered by Scholars. Published by Universities.®
Artificial Intelligence and Robotics Commons™
Open Access. Powered by Scholars. Published by Universities.®
- Keyword
-
- Machine learning (2)
- AI (1)
- Approximation Algorithms (1)
- Collaborative filtering (1)
- Computer science education (1)
-
- Coreference (1)
- Dimensionality reduction (1)
- Dissipation (1)
- Energy efficiency (1)
- Graphical models (1)
- Influence Maximization (1)
- Information Theory (1)
- Information extraction (1)
- Intelligent tutoring system (1)
- Manifold learning (1)
- Natural language processing (1)
- Network Optimization (1)
- Network Reliability (1)
- Non-equilibrium systems (1)
- Pairwise comparisons (1)
- Planning and Decision Making (1)
- Proof assistant (1)
- Proximity data (1)
- Theoretical computer science (1)
- Thermodynamic computing (1)
Articles 1 - 5 of 5
Full-Text Articles in Artificial Intelligence and Robotics
Tools For Tutoring Theoretical Computer Science Topics, Mark Mccartin-Lim
Tools For Tutoring Theoretical Computer Science Topics, Mark Mccartin-Lim
Doctoral Dissertations
This thesis introduces COMPLEXITY TUTOR, a tutoring system to assist in learning abstract proof-based topics, which has been specifically targeted towards the population of computer science students studying theoretical computer science. Existing literature has shown tremendous educational benefits produced by active learning techniques, student-centered pedagogy, gamification and intelligent tutoring systems. However, previously, there had been almost no research on adapting these ideas to the domain of theoretical computer science. As a population, computer science students receive immediate feedback from compilers and debuggers, but receive no similar level of guidance for theoretical coursework. One hypothesis of this thesis is that immediate …
Function And Dissipation In Finite State Automata - From Computing To Intelligence And Back, Natesh Ganesh
Function And Dissipation In Finite State Automata - From Computing To Intelligence And Back, Natesh Ganesh
Doctoral Dissertations
Society has benefited from the technological revolution and the tremendous growth in computing powered by Moore's law. However, we are fast approaching the ultimate physical limits in terms of both device sizes and the associated energy dissipation. It is important to characterize these limits in a physically grounded and implementation-agnostic manner, in order to capture the fundamental energy dissipation costs associated with performing computing operations with classical information in nano-scale quantum systems. It is also necessary to identify and understand the effect of quantum in-distinguishability, noise, and device variability on these dissipation limits. Identifying these parameters is crucial to designing …
Stochastic Network Design: Models And Scalable Algorithms, Xiaojian Wu
Stochastic Network Design: Models And Scalable Algorithms, Xiaojian Wu
Doctoral Dissertations
Many natural and social phenomena occur in networks. Examples include the spread of information, ideas, and opinions through a social network, the propagation of an infectious disease among people, and the spread of species within an interconnected habitat network. The ability to modify a phenomenon towards some desired outcomes has widely recognized benefits to our society and the economy. The outcome of a phenomenon is largely determined by the topology or properties of its underlying network. A decision maker can take management actions to modify a network and, therefore, change the outcome of the phenomenon. A management action is an …
Learning From Pairwise Proximity Data, Hamid Dadkhahi
Learning From Pairwise Proximity Data, Hamid Dadkhahi
Doctoral Dissertations
In many areas of machine learning, the characterization of the input data is given by a form of proximity measure between data points. Examples of such representations are pairwise differences, pairwise distances, and pairwise comparisons. In this work, we investigate different learning problems on data represented in terms of such pairwise proximities. More specifically, we consider three problems: masking (feature selection) for dimensionality reduction, extension of the dimensionality reduction for time series, and online collaborative filtering. For each of these problems, we start with a form of pairwise proximity which is relevant in the problem at hand. We evaluate the …
Epistemological Databases For Probabilistic Knowledge Base Construction, Michael Louis Wick
Epistemological Databases For Probabilistic Knowledge Base Construction, Michael Louis Wick
Doctoral Dissertations
Knowledge bases (KB) facilitate real world decision making by providing access to structured relational information that enables pattern discovery and semantic queries. Although there is a large amount of data available for populating a KB; the data must first be gathered and assembled. Traditionally, this integration is performed automatically by storing the output of an information extraction pipeline directly into a database as if this prediction were the ``truth.'' However, the resulting KB is often not reliable because (a) errors accumulate in the integration pipeline, and (b) they persist in the KB even after new information arrives that could rectify …