Browsing Computer Science and Automation (CSA) by thesis submitted date"1995"

Now showing items 1-6 of 6

    • Algorithms and characterizations for subclasses of planar perfect graphs 

      Rengarajan, S
      In this thesis, we consider two major subclasses of planar perfect graphs. We exploit certain decomposability and ordering properties to develop new characterizations and efficient algorithms. We study the Hamiltonian cycle ...

    • Deterministic parsing algorithm for classes beyond CFLs 

      Kulkarni, Sulekha R
      Deterministic parsing strategies for subclasses of the so-called mildly context-sensitive languages are proposed. Mildly context-sensitive languages are generated by k-level grammars and have parsing algorithms of time ...

    • Estimation of software release times based on a queueing model for software testing 

      Rao, D Vijay
      The development o f large-scale software systems is a complex and expensive process. The key to successful software projects is planning and estimation o f time frames for each phase o f the lifecycle. Testing plays a ...

    • Evaluating cache performance under multiprogrammed workloads 

      Sridevi, B
      Computer system performance is critically dependent on cache performance. Cache effectiveness is determined by factors such as program locality of reference and cache organization. Different approaches to cache performance ...

    • Facets of some combinatorial polytopes 

      Sarala, A
      A proven approach for solving hard combinatorial optimization problems is via polyhedral methods applied to integer programming formulations. Efficient algorithms for such problems are often problem specific and exploit ...

    • Towards complete automatic code generation 

      Kulkarni, Raghavendra K
      A compiler consists of two phases: source program analysis and object program synthesis. The problem of compilation has been tackled in depth, and many tools and techniques exist for building the analysis phase. Similar ...