Improvements to keyboard optimization with integer programming

Cite This

Files in this item

Files Size Format View

There are no files associated with this item.

KARRENBAUER, Andreas, Antti OULASVIRTA, 2014. Improvements to keyboard optimization with integer programming. UIST '14. Honolulu, Oct 5, 2014 - Oct 8, 2014. In: HRVOJE BENKO, , ed. and others. Proceedings of the 27th annual ACM symposium on User interface software and technology. New York:ACM, pp. 621-626. ISBN 978-1-4503-3069-5. Available under: doi: 10.1145/2642918.2647382

@inproceedings{Karrenbauer2014Impro-31948, title={Improvements to keyboard optimization with integer programming}, year={2014}, doi={10.1145/2642918.2647382}, isbn={978-1-4503-3069-5}, address={New York}, publisher={ACM}, booktitle={Proceedings of the 27th annual ACM symposium on User interface software and technology}, pages={621--626}, editor={Hrvoje Benko}, author={Karrenbauer, Andreas and Oulasvirta, Antti} }

<rdf:RDF xmlns:dcterms="" xmlns:dc="" xmlns:rdf="" xmlns:bibo="" xmlns:dspace="" xmlns:foaf="" xmlns:void="" xmlns:xsd="" > <rdf:Description rdf:about=""> <bibo:uri rdf:resource=""/> <dc:contributor>Karrenbauer, Andreas</dc:contributor> <dc:contributor>Oulasvirta, Antti</dc:contributor> <dc:creator>Karrenbauer, Andreas</dc:creator> <dcterms:available rdf:datatype="">2015-10-09T11:34:32Z</dcterms:available> <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/> <dc:creator>Oulasvirta, Antti</dc:creator> <dc:date rdf:datatype="">2015-10-09T11:34:32Z</dc:date> <dspace:isPartOfCollection rdf:resource=""/> <dcterms:title>Improvements to keyboard optimization with integer programming</dcterms:title> <dcterms:issued>2014</dcterms:issued> <dc:language>eng</dc:language> <foaf:homepage rdf:resource="http://localhost:8080/jspui"/> <dcterms:isPartOf rdf:resource=""/> <dcterms:abstract xml:lang="eng">Keyboard optimization is concerned with the design of keyboards for different terminals, languages, user groups, and tasks. Previous work in HCI has used random search based methods, such as simulated annealing. These "black box" approaches are convenient, because good solutions are found quickly and no assumption must be made about the objective function. This paper contributes by developing integer programming (IP) as a complementary approach. To this end, we present IP formulations for the letter assignment problem and solve them by branch-and-bound. Although computationally expensive, we show that IP offers two strong benefits. First, its structured non-random search approach improves the out- comes. Second, it guarantees bounds, which increases the designer's confidence over the quality of results. We report improvements to three keyboard optimization cases.</dcterms:abstract> </rdf:Description> </rdf:RDF>

This item appears in the following Collection(s)

Search KOPS


My Account