Compliant conditions for polynomial time approximation of operator counts

Tathagata Chakraborti, Sarath Sreedharan, Sailik Sengupta, T. K. Satish Kumar, Subbarao Kambhampati

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

In this brief abstract, we develop a computationally simpler version of the operator count heuristic for a particular class of domains. The contribution of this abstract is thus threefold, we (1) propose an efficient closed form approximation to the operator count heuristic; (2) leverage compressed sensing techniques to obtain an integer approximation in polynomial time; and (3) discuss the relationship of the proposed formulation to existing heuristics and investigate properties of domains where such approaches are useful.

Original languageEnglish (US)
Title of host publicationProceedings of the 9th Annual Symposium on Combinatorial Search, SoCS 2016
PublisherAAAI press
Pages123-124
Number of pages2
Volume2016-January
ISBN (Electronic)9781577357698
StatePublished - Jan 1 2016
Event9th Annual Symposium on Combinatorial Search, SoCS 2016 - Tarrytown, United States
Duration: Jul 6 2016Jul 8 2016

Other

Other9th Annual Symposium on Combinatorial Search, SoCS 2016
CountryUnited States
CityTarrytown
Period7/6/167/8/16

Fingerprint

Compressed sensing
Mathematical operators
Polynomials

ASJC Scopus subject areas

  • Computer Networks and Communications

Cite this

Chakraborti, T., Sreedharan, S., Sengupta, S., Satish Kumar, T. K., & Kambhampati, S. (2016). Compliant conditions for polynomial time approximation of operator counts. In Proceedings of the 9th Annual Symposium on Combinatorial Search, SoCS 2016 (Vol. 2016-January, pp. 123-124). AAAI press.

Compliant conditions for polynomial time approximation of operator counts. / Chakraborti, Tathagata; Sreedharan, Sarath; Sengupta, Sailik; Satish Kumar, T. K.; Kambhampati, Subbarao.

Proceedings of the 9th Annual Symposium on Combinatorial Search, SoCS 2016. Vol. 2016-January AAAI press, 2016. p. 123-124.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Chakraborti, T, Sreedharan, S, Sengupta, S, Satish Kumar, TK & Kambhampati, S 2016, Compliant conditions for polynomial time approximation of operator counts. in Proceedings of the 9th Annual Symposium on Combinatorial Search, SoCS 2016. vol. 2016-January, AAAI press, pp. 123-124, 9th Annual Symposium on Combinatorial Search, SoCS 2016, Tarrytown, United States, 7/6/16.
Chakraborti T, Sreedharan S, Sengupta S, Satish Kumar TK, Kambhampati S. Compliant conditions for polynomial time approximation of operator counts. In Proceedings of the 9th Annual Symposium on Combinatorial Search, SoCS 2016. Vol. 2016-January. AAAI press. 2016. p. 123-124
Chakraborti, Tathagata ; Sreedharan, Sarath ; Sengupta, Sailik ; Satish Kumar, T. K. ; Kambhampati, Subbarao. / Compliant conditions for polynomial time approximation of operator counts. Proceedings of the 9th Annual Symposium on Combinatorial Search, SoCS 2016. Vol. 2016-January AAAI press, 2016. pp. 123-124
@inproceedings{194a87d4a6824499bde7fe0b4c7d8106,
title = "Compliant conditions for polynomial time approximation of operator counts",
abstract = "In this brief abstract, we develop a computationally simpler version of the operator count heuristic for a particular class of domains. The contribution of this abstract is thus threefold, we (1) propose an efficient closed form approximation to the operator count heuristic; (2) leverage compressed sensing techniques to obtain an integer approximation in polynomial time; and (3) discuss the relationship of the proposed formulation to existing heuristics and investigate properties of domains where such approaches are useful.",
author = "Tathagata Chakraborti and Sarath Sreedharan and Sailik Sengupta and {Satish Kumar}, {T. K.} and Subbarao Kambhampati",
year = "2016",
month = "1",
day = "1",
language = "English (US)",
volume = "2016-January",
pages = "123--124",
booktitle = "Proceedings of the 9th Annual Symposium on Combinatorial Search, SoCS 2016",
publisher = "AAAI press",

}

TY - GEN

T1 - Compliant conditions for polynomial time approximation of operator counts

AU - Chakraborti, Tathagata

AU - Sreedharan, Sarath

AU - Sengupta, Sailik

AU - Satish Kumar, T. K.

AU - Kambhampati, Subbarao

PY - 2016/1/1

Y1 - 2016/1/1

N2 - In this brief abstract, we develop a computationally simpler version of the operator count heuristic for a particular class of domains. The contribution of this abstract is thus threefold, we (1) propose an efficient closed form approximation to the operator count heuristic; (2) leverage compressed sensing techniques to obtain an integer approximation in polynomial time; and (3) discuss the relationship of the proposed formulation to existing heuristics and investigate properties of domains where such approaches are useful.

AB - In this brief abstract, we develop a computationally simpler version of the operator count heuristic for a particular class of domains. The contribution of this abstract is thus threefold, we (1) propose an efficient closed form approximation to the operator count heuristic; (2) leverage compressed sensing techniques to obtain an integer approximation in polynomial time; and (3) discuss the relationship of the proposed formulation to existing heuristics and investigate properties of domains where such approaches are useful.

UR - http://www.scopus.com/inward/record.url?scp=85048617858&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85048617858&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:85048617858

VL - 2016-January

SP - 123

EP - 124

BT - Proceedings of the 9th Annual Symposium on Combinatorial Search, SoCS 2016

PB - AAAI press

ER -