{"id":12594,"date":"2021-11-13T17:09:08","date_gmt":"2021-11-13T22:09:08","guid":{"rendered":"https:\/\/carleton.ca\/scs\/?page_id=12594"},"modified":"2026-06-02T14:59:26","modified_gmt":"2026-06-02T18:59:26","slug":"tr-84-deterministic-learning-automata-solutions-to-the-object-partitioning-problem","status":"publish","type":"page","link":"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1985\/tr-84-deterministic-learning-automata-solutions-to-the-object-partitioning-problem\/","title":{"rendered":"TR-84: Deterministic Learning Automata Solutions to the Object Partitioning Problem"},"content":{"rendered":"\n<section class=\"w-screen px-6 cu-section cu-section--white ml-offset-center md:px-8 lg:px-14\">\n    <div class=\"space-y-6 cu-max-w-child-5xl  md:space-y-10 cu-prose-first-last\">\n\n            <div class=\"cu-textmedia flex flex-col lg:flex-row mx-auto gap-6 md:gap-10 my-6 md:my-12 first:mt-0 max-w-5xl\">\n        <div class=\"justify-start cu-textmedia-content cu-prose-first-last\" style=\"flex: 0 0 100%;\">\n            <header class=\"font-light prose-xl cu-pageheader md:prose-2xl cu-component-updated cu-prose-first-last\">\n                                    <h1 class=\"cu-prose-first-last font-semibold !mt-2 mb-4 md:mb-6 relative after:absolute after:h-px after:bottom-0 after:bg-cu-red after:left-px text-3xl md:text-4xl lg:text-5xl lg:leading-[3.5rem] pb-5 after:w-10 text-cu-black-700 not-prose\">\n                        TR-84: Deterministic Learning Automata Solutions to the Object Partitioning Problem\n                    <\/h1>\n                \n                                \n                            <\/header>\n\n                    <\/div>\n\n            <\/div>\n\n    <\/div>\n<\/section>\n\n<p>Carleton University<br>\n<a href=\"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1985\/\">Technical Report<\/a> <strong>TR-84<\/strong><br>\nNovember 1985<\/p>\n\n\n\n<h2 id=\"deterministic-learning-automata-solutions-to-the-object-partitioning-problem\" class=\"wp-block-heading tr_t1\">Deterministic Learning Automata Solutions to the Object Partitioning Problem<\/h2>\n\n\n\n<div class=\"tr_t3\">B. John Oommen &amp; D.C.Y. Ma<\/div>\n\n\n\n<div>\n<h3>Abstract<\/h3>\n<p>Let rt = {A1 , &#8230; , Aw} be a set of W objects to be equi-partitioned into R classes {P 1 , &#8230; , PR}. The objects are accessed in groups, their joint access probabilities being unknown. The intention is that the objects accessed more frequently together are located in the same class. This problem has been known to be NP-hard [30]. In this paper, we propose three deterministic learning automata solutions to the problem. Although the first two are \u00a3-optimal, they seem to be practically feasible only when W is small. The last solution, which uses a new learning automaton, demonstrates an excellent partitioning capability. Experimentally, this solution converges an order of magnitude faster than the best known algorithm in the literature [30].<\/p>\n<\/div>\n\n\n\n<p><a href=\"https:\/\/carleton.ca\/scs\/wp-content\/uploads\/sites\/260\/TR-84.pdf\">TR-84.pdf<\/a><\/p>\n","protected":false},"excerpt":{"rendered":"<p>Carleton University Technical Report TR-84 November 1985 Deterministic Learning Automata Solutions to the Object Partitioning Problem B. John Oommen &amp; D.C.Y. Ma Abstract Let rt = {A1 , &#8230; , Aw} be a set of W objects to be equi-partitioned into R classes {P 1 , &#8230; , PR}. The objects are accessed in groups, [&hellip;]<\/p>\n","protected":false},"author":2,"featured_media":0,"parent":11823,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"_acf_changed":false,"_cu_dining_location_slug":"","footnotes":"","_links_to":"","_links_to_target":""},"cu_page_type":[88],"class_list":["post-12594","page","type-page","status-publish","hentry","cu_page_type-technical-report"],"acf":{"cu_post_thumbnail":false},"_links":{"self":[{"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/pages\/12594","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/users\/2"}],"replies":[{"embeddable":true,"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/comments?post=12594"}],"version-history":[{"count":2,"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/pages\/12594\/revisions"}],"predecessor-version":[{"id":12604,"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/pages\/12594\/revisions\/12604"}],"up":[{"embeddable":true,"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/pages\/11823"}],"wp:attachment":[{"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/media?parent=12594"}],"wp:term":[{"taxonomy":"cu_page_type","embeddable":true,"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/cu_page_type?post=12594"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}