<?xml version="1.0" encoding="UTF-8"?>
<record
    xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
    xsi:schemaLocation="http://www.loc.gov/MARC21/slim http://www.loc.gov/standards/marcxml/schema/MARC21slim.xsd"
    xmlns="http://www.loc.gov/MARC21/slim">

  <leader>02444nam a22001337a 4500</leader>
  <datafield tag="999" ind1=" " ind2=" ">
    <subfield code="c">68371</subfield>
    <subfield code="d">68368</subfield>
  </datafield>
  <datafield tag="100" ind1=" " ind2=" ">
    <subfield code="a">Anjum Usman</subfield>
    <subfield code="a">21-MCSE-05</subfield>
    <subfield code="a">Supervisor - Prof.Dr. Ubedullah Rajput </subfield>
  </datafield>
  <datafield tag="245" ind1=" " ind2=" ">
    <subfield code="a">Quality Estimation of Approximate Computing Using Machine Learning (MS Thesis)</subfield>
  </datafield>
  <datafield tag="260" ind1=" " ind2=" ">
    <subfield code="a">Nawabshah</subfield>
    <subfield code="b">QUEST</subfield>
    <subfield code="c">2024</subfield>
  </datafield>
  <datafield tag="300" ind1=" " ind2=" ">
    <subfield code="a">90p.</subfield>
  </datafield>
  <datafield tag="520" ind1=" " ind2=" ">
    <subfield code="a">ABSTRACT

This thesis focuses on approximate computing, a strategy to balance performance and energy efficiency by trading a slight loss of accuracy for significant speed and power gains. However, ensuring acceptable result quality remains a challenge. The study introduces a novel approach that utilizes machine learning to predict the quality of approximate computations. The goal is to create a robust framework that helps designers make informed decisions between accuracy and efficiency. A comprehensive dataset is compiled, containing diverse approximate computing instances with quality metrics. Various features from the dataset, including computation traits and error rates, are used as inputs for machine learning models. After rigorous exploration of machine learning algorithms, a refined model that demonstrates strong predictive performance across various inaccurate computing scenarios is selected.

In order to enhance the capacity to forecast outcomes in approximate computing more precisely, this research applies transfer learning techniques. Pretrained models are more accurate than the originally trained model when they are adjusted using specific, imperfect computational input. The framework consistently produces correct quality estimates for a variety of computations and has undergone extensive validation through a battery of tests. It aids in the decision-making process for highly effective and energy-efficient system designers. The framework's flexibility and generalizability are validated by empirical evaluation of real-world applications. In order to assess approximation accuracy, a unique machine-learning process is proposed in this study. It illustrates how effective transfer learning is in this situation. This approach helps designers to effectively control the trade-off between accuracy and efficiency in the rapidly developing field of approximation computing, which is becoming more and more crucial as the need for efficient computing systems grows.

xii</subfield>
  </datafield>
  <datafield tag="650" ind1=" " ind2=" ">
    <subfield code="a">Department of Computer Systems Engineering </subfield>
  </datafield>
  <datafield tag="856" ind1=" " ind2=" ">
    <subfield code="u">https://tinyurl.com/5n8bfkbs</subfield>
  </datafield>
  <datafield tag="942" ind1=" " ind2=" ">
    <subfield code="c">THESIS</subfield>
  </datafield>
  <datafield tag="952" ind1=" " ind2=" ">
    <subfield code="0">0</subfield>
    <subfield code="1">0</subfield>
    <subfield code="4">0</subfield>
    <subfield code="7">0</subfield>
    <subfield code="a">RESEARCH</subfield>
    <subfield code="b">RESEARCH</subfield>
    <subfield code="d">2024-05-27</subfield>
    <subfield code="l">0</subfield>
    <subfield code="p">MP/89-1286</subfield>
    <subfield code="r">2024-05-27 00:00:00</subfield>
    <subfield code="w">2024-05-27</subfield>
    <subfield code="y">THESIS</subfield>
  </datafield>
  <datafield tag="952" ind1=" " ind2=" ">
    <subfield code="0">0</subfield>
    <subfield code="1">0</subfield>
    <subfield code="4">0</subfield>
    <subfield code="7">0</subfield>
    <subfield code="a">RESEARCH</subfield>
    <subfield code="b">RESEARCH</subfield>
    <subfield code="d">2024-05-27</subfield>
    <subfield code="l">0</subfield>
    <subfield code="p">MP/89-1287</subfield>
    <subfield code="r">2024-05-27 00:00:00</subfield>
    <subfield code="w">2024-05-27</subfield>
    <subfield code="y">THESIS</subfield>
  </datafield>
  <datafield tag="952" ind1=" " ind2=" ">
    <subfield code="0">0</subfield>
    <subfield code="1">0</subfield>
    <subfield code="4">0</subfield>
    <subfield code="7">0</subfield>
    <subfield code="a">RESEARCH</subfield>
    <subfield code="b">RESEARCH</subfield>
    <subfield code="d">2024-05-27</subfield>
    <subfield code="l">0</subfield>
    <subfield code="p">MP/89-1288</subfield>
    <subfield code="r">2024-05-27 00:00:00</subfield>
    <subfield code="w">2024-05-27</subfield>
    <subfield code="y">THESIS</subfield>
  </datafield>
  <datafield tag="952" ind1=" " ind2=" ">
    <subfield code="0">0</subfield>
    <subfield code="1">0</subfield>
    <subfield code="4">0</subfield>
    <subfield code="7">0</subfield>
    <subfield code="a">RESEARCH</subfield>
    <subfield code="b">RESEARCH</subfield>
    <subfield code="d">2024-07-26</subfield>
    <subfield code="l">0</subfield>
    <subfield code="p">MP/91-1319</subfield>
    <subfield code="r">2024-07-26 00:00:00</subfield>
    <subfield code="w">2024-07-26</subfield>
    <subfield code="y">THESIS</subfield>
  </datafield>
</record>
