• 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 2-21 of 351

    • title
    • xmlui.ArtifactBrowser.ConfigurableBrowse.sort_by.datesubmitted
    • issue date
    • ascending
    • descending
    • 5
    • 10
    • 20
    • 40
    • 60
    • 80
    • 100
      • Access Path Based Dataflow Analysis For Sequential And Concurrent Programs 

        Arnab De, * (2016-09-14)
        In this thesis, we have developed a flow-sensitive data flow analysis framework for value set analyses for Java-like languages. Our analysis frame work is based on access paths—a variable followed by zero or more field ...
      • ACE-Model: A Conceptual Evolutionary Model For Evolutionary Computation And Artificial Life 

        Dukkipati, Ambedkar (Indian Institute of Science, 2005-02-07)
        Darwinian Evolutionary system - a system satisfying the abstract conditions: reproduction with heritable variation, in a finite world, giving rise to Natural Selection encompasses a complex and subtle system of interrelated ...
      • Achieving Fairness in the Stochastic Multi-Armed Bandit Problem 

        Patil, Vishakha
        The classical Stochastic Multi-armed Bandit (MAB) problem provides an abstraction for many real-world decision making problems such as sponsored-search auctions, crowd-sourcing, wireless communication, etc. In this work, ...
      • Achieving practical secure non-volatile memory system with in-Memory Integrity Verification (iMIV) 

        Jain, Rajat
        Recent commercialization of Non-Volatile Memory (NVM) technology in the form of Intel Optane enables programmers to write recoverable programs. However, the data on NVM is susceptible to a plethora of data remanence attacks, ...
      • Acyclic Edge Coloring Of Graphs 

        Basavaraju, Manu (2013-10-07)
        A proper edge coloring of G =(V,E)is a map c : E → C (where C is the set of available colors ) with c(e) ≠ c(ƒ) for any adjacent edges e,f. The minimum number of colors needed to properly color the edges of G, is called ...
      • Adaptive Hierarchial RAID 

        Muppalaneni, Nitin (Indian Institute of Science, 2005-02-08)
        Redundant Arrays of Inexpensive Disks or RAID is a popular method of improving the reliability and performance of disk storage. Of various levels of RAID, mirrored or RAID1 and rotating parity or RAID5 configurations have ...
      • An Adaptive Recompilation Framework For Rotor And Architectural Support For Online Program Instrumentation 

        Vaswani, Kapil (Indian Institute of Science, 2005-12-07)
        Although runtime systems and the dynamic compilation model have revolutionized the process of application development and deployment, the associated performance overheads continue to be a cause for concern and much research. ...
      • Adaptive Selective Flooding Qos Routing 

        Porwal, Rupesh (Indian Institute of Science, 2005-02-08)
        The routing strategy used in today's Internet is best-effort service, where all data packets are treated equally. This type of service is not suited for applications such as video conferencing, and video on demand, that ...
      • Adaptively Secure Primitives in the Random Oracle Model 

        Sarkar, Pratik
        Adaptive security embodies one of the strongest notions of security that allows an adversary to corrupt parties at any point during protocol execution and gain access to its internal state. Since it models reallife situations ...
      • Algorithmic and Combinatorial Questions on Some Geometric Problems on Graphs 

        Babu, Jasine (2018-05-08)
        This thesis mainly focuses on algorithmic and combinatorial questions related to some geometric problems on graphs. In the last part of this thesis, a graph coloring problem is also discussed. Boxicity and Cubicity: These ...
      • An Algorithmic Characterization Of Polynomial Functions Over Zpn 

        Guha, Ashwin (2014-07-04)
        The problem of polynomial representability of functions is central to many branches of mathematics. If the underlying set is a finite field, every function can be represented as a polynomial. In this thesis we consider ...
      • Algorithms And Models For Debugging Distributed Programs 

        Sampath, D (2012-05-04)
      • Algorithms for Challenges to Practical Reinforcement Learning 

        Sindhu, P R
        Reinforcement learning (RL) in real world applications faces major hurdles - the foremost being safety of the physical system controlled by the learning agent and the varying environment conditions in which the autonomous ...
      • Algorithms For Efficient Implementation Of Secure Group Communication Systems 

        Rahul, S (2007-10-23)
        A distributed application may be considered as a set of nodes which are spread across the network, and need to communicate with each other. The design and implementation of these distributed applications is greatly simplified ...
      • Algorithms for Fair Clustering 

        Allabadi, Swati
        Many decisions today are taken by various machine learning algorithms, hence it is crucial to accommodate fairness in such algorithms to remove/reduce any kind of bias in the decision. We incorporate fairness in the ...
      • Algorithms for Fair Decision Making: Provable Guarantees and Applications 

        Biswas, Arpita
        The topic of fair allocation of indivisible items has received significant attention because of its applicability in several real-world settings. This has led to a vast body of work focusing on defining appropriate fairness ...
      • Algorithms for Multilingual IR in Low Resource Languages using Weakly Aligned Corpora 

        Tholpadi, Goutham
        Multilingual information retrieval (MLIR) methods generally rely on linguistic resources such as dictionaries, parallel corpora, etc., to overcome the language barrier. For low resource languages without these resources, ...
      • Algorithms For Piecewise Linear Knapsack Problems With Applications In Electronic Commerce 

        Kameshwaran, S (2011-04-19)
      • Algorithms for Product Pricing and Energy Allocation in Energy Harvesting Sensor Networks 

        Sindhu, P R (2018-05-09)
        In this thesis, we consider stochastic systems which arise in different real-world application contexts. The first problem we consider is based on product adoption and pricing. A monopolist selling a product has to appropriately ...
      • Algorithms For Profiling And Representing Programs With Applications To Speculative Optimizations 

        Roy, Subhajit (2013-09-17)

        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