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

    Search

    Show Advanced FiltersHide Advanced Filters

    Filters

    Use filters to refine the search results.

    Now showing items 1-10 of 22

    • Sort Options:
    • Relevance
    • Title Asc
    • Title Desc
    • Issue Date Asc
    • Issue Date Desc
    • Results Per Page:
    • 5
    • 10
    • 20
    • 40
    • 60
    • 80
    • 100

    Feature Adaptation Algorithms for Reinforcement Learning with Applications to Wireless Sensor Networks And Road Traffic Control 

    Prabuchandran, K J (2017-09-20)
    Many sequential decision making problems under uncertainty arising in engineering, science and economics are often modelled as Markov Decision Processes (MDPs). In the setting of MDPs, the goal is to and a state dependent ...

    Model-Checking Infinite-State Systems For Information Flow Security Properties 

    Raghavendra, K R (2017-02-16)
    Information flow properties are away of specifying security properties of systems ,dating back to the work of Goguen and Meseguer in the eighties. In this framework ,a system is modeled as having high-level (or confidential)events ...

    Automatic Data Allocation, Buffer Management And Data Movement For Multi-GPU Machines 

    Ramashekar, Thejas (2017-05-24)
    Multi-GPU machines are being increasingly used in high performance computing. These machines are being used both as standalone work stations to run computations on medium to large data sizes (tens of gigabytes) and as a ...

    Computational And Combinatorial Problems On Some Geometric Proximity Graphs 

    Khopkar, Abhijeet (2017-05-24)
    In this thesis, we focus on the study of computational and combinatorial problems on various geometric proximity graphs. Delaunay and Gabriel graphs are widely studied geometric proximity structures. These graphs have been ...

    Retweet Profiling - Study Dissemination of Twitter Messages 

    Rangnani, Soniya (2017-09-23)
    Social media has become an important means of everyday communication. It is a mechanism for “sharing” and “resharing” of information. While social network platforms provide the means to users for resharing/reblogging (aka ...

    Provable Methods for Non-negative Matrix Factorization 

    Pani, Jagdeep (2017-10-31)
    Nonnegative matrix factorization (NMF) is an important data-analysis problem which concerns factoring a given d n matrix A with nonnegative entries into matrices B and C where B and C are d k and k n with nonnegative ...

    Module Grobner Bases Over Fields With Valuation 

    Sen, Aritra (2017-07-12)
    Tropical geometry is an area of mathematics that interfaces algebraic geometry and combinatorics. The main object of study in tropical geometry is the tropical variety, which is the combinatorial counterpart of a classical ...

    Tiling Stencil Computations To Maximize Parallelism 

    Bandishti, Vinayaka Prakasha (2017-05-21)
    Stencil computations are iterative kernels often used to simulate the change in a discretized spatial domain overtime (e.g., computational fluid dynamics) or to solve for unknowns in a discretized space by converging to a ...

    MIST : Mlgrate The Storage Too 

    Kamala, R (2017-05-25)
    We address the problem of migration of local storage of desktop users to remote sites. Assuming a network connection is maintained between the source and destination after the migration makes it possible for us to transfer ...

    Resource Allocation for Sequential Decision Making Under Uncertainaty : Studies in Vehicular Traffic Control, Service Systems, Sensor Networks and Mechanism Design 

    Prashanth, L A (2017-11-27)
    A fundamental question in a sequential decision making setting under uncertainty is “how to allocate resources amongst competing entities so as to maximize the rewards accumulated in the long run?”. The resources allocated ...
    • 1
    • 2
    • 3

    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

    Discover

    AuthorAgrawal, Akanksha (1)Bandishti, Vinayaka Prakasha (1)Chugh, Pallavi (1)Dey, Palash (1)Dutt, Anshuman (1)Kamala, R (1)Khopkar, Abhijeet (1)Laha, Anirban (1)Maity, Soumyadev (1)Manjunath, Geetha (1)... View MoreSubjectComputer Science (18)Computational Geometry (3)Bipartite Ranking (2)Geometric Objects (2)Reinforcement Learning (2)Sensor Networks (2)Access Control Models (1)Adaptive Labor Staffing (1)Adaptive Sleep–wake Control (1)Affine Loop Nests (1)... View MoreDate Issued
    2017 (22)
    Has File(s)Yes (22)

    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