Now showing items 1-11 of 11

    • Analysis of address allocation protocols for mobile ad hoc networks 

      Sati, Mohit (Dhirubhai Ambani Institute of Information and Communication Technology, 2011)
      In almost all networks, it is necessary to have a unique identifier for each node. This identifier is used to find out route locating a particular node. So an address is must for any node for unicast communication. Addresses ...
    • Bin Packing with Advice 

      Shah, Akash (Dhirubhai Ambani Institute of Information and Communication Technology, 2017)
      "The framework of competitive analysis is often used to study the bin packing algorithms. Under this framework, the behavior of online algorithms is compared to an optimal offline algorithm on the worst possible input. In ...
    • Exact algorithm for segment based sequence alignment 

      Tailor, Divyesh (Dhirubhai Ambani Institute of Information and Communication Technology, 2015)
      In bioinformatics, proteins, large biological molecules consisting long chain of amino acids, are described by a sequence of 20 amino acids. To analyze these protein sequences pairwise alignment is being used, which ...
    • Game theory based strategies for cooperation in ad hoc wireless networks 

      Rajput, Nitin Singh (Dhirubhai Ambani Institute of Information and Communication Technology, 2010)
      In self-organized ad-hoc wireless networks, nodes belong to different authorities, pursue different goals, have constrains like energy; therefore, cooperation among them cannot be taken for granted. Non cooperation of nodes ...
    • Heuristic approach for segment based pairwise sequence alignment in bioinformatics 

      Desai, Jeet (Dhirubhai Ambani Institute of Information and Communication Technology, 2015)
      0
    • Heuristics for pair-wise sequence alignment 

      Patel, Dhara (Dhirubhai Ambani Institute of Information and Communication Technology, 2015)
      Develop framework for pairwise alignment of given two sequences based on their feature. There may be situation in which sequences look different but share common structure, function or evolutionary related information. ...
    • Negotiation for resource allocation on infrastructure as a service cloud 

      Akhani, Janki (Dhirubhai Ambani Institute of Information and Communication Technology, 2010)
      The Cloud is a computing platform that provides dynamic resource pools, virtualization, and high availability. Cloud computing infrastructures can allow enterprises to achieve more efficient use of their IT hardware and ...
    • Query optimization of object oriented database through compilation and execution 

      Khandhar, Mihir (Dhirubhai Ambani Institute of Information and Communication Technology, 2014)
      Database is central to many applications like a website, app, software or any business applications to store the data in various formats which can be retrieved efficiently and conveniently as and when required by the ...
    • Resource allocation on infrastructure as a service cloud using policies 

      Nathani, Amit (Dhirubhai Ambani Institute of Information and Communication Technology, 2010)
      Conventionally, a cloud refers to an Infrastructure as a service cloud. Infrastructure as a service cloud providers manage a large set of computing resources. These resources can be provided to cloud users on demand in the ...
    • Sequence Alignment Based on segment to segment Comparision 

      Desai, Meet (Dhirubhai Ambani Institute of Information and Communication Technology, 2017)
      "Computational Biology. MSA is a known NP-Complete Problem and hence the focus is always on approximation algorithms and heuristics. Most of the current MSA methods work at residue level i.e they are based on residue to ...
    • Set labelling vertices and study of auxiliary graphs 

      Jadeja, Mahipal Prithvisinh (Dhirubhai Ambani Institute of Information and Communication Technology, 2018)
      Given a set of nonempty subsets of some universal set, their intersection graph is defined as the graph with one vertex for each set and two vertices are adjacent precisely when their representing sets have non-empty ...