• Login
    Browsing Computer Science and Automation (CSA) by Title 
    •   etd@IISc
    • Division of Electrical, Electronics, and Computer Science (EECS)
    • Computer Science and Automation (CSA)
    • Browsing Computer Science and Automation (CSA) by Title
    •   etd@IISc
    • Division of Electrical, Electronics, and Computer Science (EECS)
    • Computer Science and Automation (CSA)
    • Browsing Computer Science and Automation (CSA) by Title
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Browsing Computer Science and Automation (CSA) by Title

    • 0-9
    • A
    • B
    • C
    • D
    • E
    • F
    • G
    • H
    • I
    • J
    • K
    • L
    • M
    • N
    • O
    • P
    • Q
    • R
    • S
    • T
    • U
    • V
    • W
    • X
    • Y
    • Z

    Sort by:

    Order:

    Results:

    Now showing items 347-366 of 394

    • title
    • xmlui.ArtifactBrowser.ConfigurableBrowse.sort_by.datesubmitted
    • issue date
    • ascending
    • descending
    • 5
    • 10
    • 20
    • 40
    • 60
    • 80
    • 100
      • Solution Of Delayed Reinforcement Learning Problems Having Continuous Action Spaces 

        Ravindran, B (2012-05-29)
      • Some Theoretical Contributions To The Mutual Exclusion Problem 

        Alagarsamy, K (2012-12-04)
      • Sparse Multiclass And Multi-Label Classifier Design For Faster Inference 

        Bapat, Tanuja (2013-06-20)
        Many real-world problems like hand-written digit recognition or semantic scene classification are treated as multiclass or multi-label classification prob-lems. Solutions to these problems using support vector machines (SVMs) ...
      • Specification Synthesis with Constrained Horn Clauses 

        Sumanth Prabhu, S
        Many practical problems in software development, verification and testing rely on specifications. The problem of specification synthesis is to automatically find relational constraints for undefined functions, called ...
      • Spill Code Minimization And Buffer And Code Size Aware Instruction Scheduling Techniques 

        Nagarakatte, Santosh G (2009-05-19)
        Instruction scheduling and Software pipelining are important compilation techniques which reorder instructions in a program to exploit instruction level parallelism. They are essential for enhancing instruction level ...
      • A Static Slicing Tool for Sequential Java Programs 

        Devaraj, Arvind (2018-07-28)
        A program slice consists of a subset of the statements of a program that can potentially affect values computed at some point of interest. Such a point of interest along with a set of variables is called a slicing criterion. ...
      • Statistical Network Analysis: Community Structure, Fairness Constraints, and Emergent Behavior 

        Gupta, Shubham
        Networks or graphs provide mathematical tools for describing and analyzing relational data. They are used in biology to model interactions between proteins, in economics to identify trade alliances among countries, in ...
      • Stochastic Approximation Algorithms with Set-valued Dynamics : Theory and Applications 

        Ramaswamy, Arunselvan (2018-07-05)
        Stochastic approximation algorithms encompass a class of iterative schemes that converge to a sought value through a series of successive approximations. Such algorithms converge even when the observations are erroneous. ...
      • Stochastic Approximation with Markov Noise: Analysis and applications in reinforcement learning 

        Karmakar, Prasenjit
        Stochastic approximation algorithms are sequential non-parametric methods for finding a zero or minimum of a function in the situation where only the noisy observations of the function values are available. Two time-scale ...
      • Stochastic approximation with set-valued maps and Markov noise: Theoretical foundations and applications 

        Yaji, Vinayaka Ganapati
        Stochastic approximation algorithms produce estimates of a desired solution using noisy real world data. Introduced by Robbins and Monro, in 1951, stochastic approximation techniques have been instrumental in the asymptotic ...
      • Stochastic Newton Methods With Enhanced Hessian Estimation 

        Reddy, Danda Sai Koti (2018-05-22)
        Optimization problems involving uncertainties are common in a variety of engineering disciplines such as transportation systems, manufacturing, communication networks, healthcare and finance. The large number of input ...
      • Stochastic Optimization And Its Application In Reinforcement Learning 

        Mondal, Akash
        Numerous engineering fields, such as transportation systems, manufacturing, communication networks, healthcare, and finance, frequently encounter problems requiring optimization in the presence of uncertainty. Simulation-based ...
      • Structured Regularization Through Convex Relaxations Of Discrete Penalties 

        Sankaran, Raman
        Motivation. Empirical risk minimization(ERM) is a popular framework for learning predictive models from data, which has been used in various domains such as computer vision, text processing, bioinformatics, neuro-biology, ...
      • Studies In Automatic Management Of Storage Systems 

        Pipada, Pankaj (2015-11-16)
        Autonomic management is important in storage systems and the space of autonomics in storage systems is vast. Such autonomic management systems can employ a variety of techniques depending upon the specific problem. In this ...
      • A Study Of Quantum And Reversible Computing 

        Paul, Arnab (2013-07-31)
      • A Study of the Performance Benefits of Controlling Parallel Asynochrous Iteractive Applications 

        Joseph, P J (Indian Institute of Science, 2005-03-11)
        High performance networks of workstation are becoming increasingly popular a parallel computing platform because of their lower cost. Both message passing and software distributed shared memory (DSM) programming paradigms ...
      • A Study of Thompson Sampling Approach for the Sleeping Multi-Armed Bandit Problem 

        Chatterjee, Aritra (2018-05-29)
        The multi-armed bandit (MAB) problem provides a convenient abstraction for many online decision problems arising in modern applications including Internet display advertising, crowdsourcing, online procurement, smart grids, ...
      • Superscalar Processor Models Using Statistical Learning 

        Joseph, P J (2009-06-24)
        Processor architectures are becoming increasingly complex and hence architects have to evaluate a large design space consisting of several parameters, each with a number of potential settings. In order to assist in guiding ...
      • Supervised Classification of Missense Mutations as Pathogenic or Tolerated using Ensemble Learning Methods 

        Balasubramanyam, Rashmi (2018-07-09)
        Missense mutations account for more than 50% of the mutations known to be involved in human inherited diseases. Missense classification is a challenging task that involves sequencing of the genome, identifying the variations, ...
      • Symmetry in Scalar Fields 

        Thomas, Dilip Mathew (2018-01-09)
        Scalar fields are used to represent physical quantities measured over a domain of interest. Study of symmetric or repeating patterns in scalar fields is important in scientific data analysis because it gives deep insights ...

        etd@IISc is a joint service of SERC & J R D Tata Memorial (JRDTML) Library || Powered by DSpace software || DuraSpace
        Contact Us | Send Feedback | Thesis Templates
        Theme by 
        Atmire NV
         

         

        Browse

        All of etd@IIScCommunities & CollectionsTitlesAuthorsAdvisorsSubjectsBy Thesis Submission DateThis CollectionTitlesAuthorsAdvisorsSubjectsBy Thesis Submission Date

        My Account

        LoginRegister

        etd@IISc is a joint service of SERC & J R D Tata Memorial (JRDTML) Library || Powered by DSpace software || DuraSpace
        Contact Us | Send Feedback | Thesis Templates
        Theme by 
        Atmire NV