@Article{	  oommen_adaptive_1991,
  title		= {An adaptive learning solution to the keyboard optimization
		  problem},
  volume	= {21},
  issn		= {0018-9472},
  doi		= {10.1109/21.135704},
  abstract	= {The authors consider the problem of assigning more than
		  one symbol of a finite alphabet A to the same key on a
		  keyboard. Since multiple symbols of the alphabet A reside
		  on the same key, the representations of all the words in a
		  finite dictionary H need not be unique. The problem is one
		  of optimally assigning the symbols of the alphabet to the
		  keys of a given keyboard with a view to minimize the total
		  number of words that have ambiguous representation. The
		  problem is proven to be {NP}-hard. After presenting the
		  only reported solution to the problem, a fast
		  learning-automaton-based solution to this problem is
		  reported. Experimental results demonstrating the power of
		  this solution are presented.{\textless}{\textgreater}},
  pages		= {1608--1618},
  number	= {6},
  journaltitle	= {{IEEE} Transactions on Systems, Man, and Cybernetics},
  author	= {Oommen, B. J. and Valiveti, R. S. and Zgierski, J. R.},
  date		= {1991-11}
}

{"_id":"QthRzad8YHbjAyvtT","bibbaseid":"oommen-valiveti-zgierski-anadaptivelearningsolutiontothekeyboardoptimizationproblem","author_short":["Oommen, B. J.","Valiveti, R. S.","Zgierski, J. R."],"bibdata":{"bibtype":"article","type":"article","title":"An adaptive learning solution to the keyboard optimization problem","volume":"21","issn":"0018-9472","doi":"10.1109/21.135704","abstract":"The authors consider the problem of assigning more than one symbol of a finite alphabet A to the same key on a keyboard. Since multiple symbols of the alphabet A reside on the same key, the representations of all the words in a finite dictionary H need not be unique. The problem is one of optimally assigning the symbols of the alphabet to the keys of a given keyboard with a view to minimize the total number of words that have ambiguous representation. The problem is proven to be NP-hard. After presenting the only reported solution to the problem, a fast learning-automaton-based solution to this problem is reported. Experimental results demonstrating the power of this solution are presented.\\textless\\textgreater","pages":"1608–1618","number":"6","journaltitle":"IEEE Transactions on Systems, Man, and Cybernetics","author":[{"propositions":[],"lastnames":["Oommen"],"firstnames":["B.","J."],"suffixes":[]},{"propositions":[],"lastnames":["Valiveti"],"firstnames":["R.","S."],"suffixes":[]},{"propositions":[],"lastnames":["Zgierski"],"firstnames":["J.","R."],"suffixes":[]}],"date":"1991-11","bibtex":"@Article{\t oommen_adaptive_1991,\n title\t\t= {An adaptive learning solution to the keyboard optimization\n\t\t problem},\n volume\t= {21},\n issn\t\t= {0018-9472},\n doi\t\t= {10.1109/21.135704},\n abstract\t= {The authors consider the problem of assigning more than\n\t\t one symbol of a finite alphabet A to the same key on a\n\t\t keyboard. Since multiple symbols of the alphabet A reside\n\t\t on the same key, the representations of all the words in a\n\t\t finite dictionary H need not be unique. The problem is one\n\t\t of optimally assigning the symbols of the alphabet to the\n\t\t keys of a given keyboard with a view to minimize the total\n\t\t number of words that have ambiguous representation. The\n\t\t problem is proven to be {NP}-hard. After presenting the\n\t\t only reported solution to the problem, a fast\n\t\t learning-automaton-based solution to this problem is\n\t\t reported. Experimental results demonstrating the power of\n\t\t this solution are presented.{\\textless}{\\textgreater}},\n pages\t\t= {1608--1618},\n number\t= {6},\n journaltitle\t= {{IEEE} Transactions on Systems, Man, and Cybernetics},\n author\t= {Oommen, B. J. and Valiveti, R. S. and Zgierski, J. R.},\n date\t\t= {1991-11}\n}\n\n","author_short":["Oommen, B. J.","Valiveti, R. S.","Zgierski, J. R."],"key":"oommen_adaptive_1991","id":"oommen_adaptive_1991","bibbaseid":"oommen-valiveti-zgierski-anadaptivelearningsolutiontothekeyboardoptimizationproblem","role":"author","urls":{},"metadata":{"authorlinks":{}}},"bibtype":"article","biburl":"https://raw.githubusercontent.com/rsvaliveti/pubs/main/papers.bib","dataSources":["Ya3KsBG9WEWneaMEw"],"keywords":[],"search_terms":["adaptive","learning","solution","keyboard","optimization","problem","oommen","valiveti","zgierski"],"title":"An adaptive learning solution to the keyboard optimization problem","year":null}