• 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 51-60 of 559

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

    Design Of Truthful Allocation Mechanisms For Carbon Footprint Reduction 

    Udaya Lakshmi, L (2014-06-05)
    Global warming is currently a major challenge faced by the world. Reduction of carbon emissions is of paramount importance in the context of global warming. There are widespread ongoing efforts to find satisfactory ways ...

    Rainbow Connection Number Of Graph Power And Graph Products 

    Arunselvan, R (2014-09-09)
    The minimum number of colors required to color the edges of a graph so that any two distinct vertices are connected by at least one path in which no two edges are colored the same is called its rainbow connection number. ...

    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 ...

    Two Player Game Variant Of The Erdos Szekeres Problem 

    Parikshit, K (2014-08-01)
    The following problem has been known for its beauty and elementary character. The Erd˝os Szekeres problem[7]: For any integer k ≥ 3, determine if there exists a smallest positive integer N(k) such that any set of atleast ...

    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. ...

    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 ...

    Weighted Average Based Clock Synchronization Protocols For Wireless Sensor Networks 

    Swain, Amulya Ratna (2016-07-12)
    Wireless Sensor Networks (WSNs) consist of a large number of resource constrained sensor nodes equipped with various sensing devices which can monitor events in the real world. There are various applications such as ...

    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 ...

    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 ...

    A Compiler and Symbolic Debugger for Occam 

    Chelliah, M (Indian Institute of Science, 2005-03-03)
    We have implemented Occam, a parallel programming language, on a uniprocessor machine (MC-68020 based HORIZON I11 running on UNIX system V.2) with simulated concurrency. Occam is a descendant of CSP with a few convenient ...
    • 1
    • . . .
    • 3
    • 4
    • 5
    • 6
    • 7
    • 8
    • 9
    • . . .
    • 56

    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

    AuthorAjith, S (2)Arun, R (2)Babu, T Ravindra (2)Bharadwaj, Subramanya B V (2)Dayama, Pankaj (2)Deodhare, Dipti (2)Dubey, Abhishek (2)Dukkipati, Ambedkar (2)Goswami, Asis K (2)Gupta, Nikhil (2)... View MoreSubjectComputer Science (195)TECHNOLOGY (135)Computer and Information Science (28)Machine Learning (24)Game Theory (15)Reinforcement Learning (15)Cryptography (14)Graph Theory (10)Deep Learning (9)Markov Decision Processes (9)... View MoreDate Issued2010 - 2018 (189)2005 - 2009 (49)Has File(s)
    Yes (559)

    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