Paper Info
Title
Improvements to keyboard optimization with integer programming
Abstract
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.
Year
DOI
Venue
2014
10.1145/2642918.2647382
UIST
Keywords
Field
DocType
user interface optimization,user interfaces,integer programming,branch-and-bound,keyboard layouts,random search methods,branch and bound
Simulated annealing,Black box (phreaking),Random search,Branch and bound,Quality of results,Computer science,Theoretical computer science,Assignment problem,Integer programming
Conference
Citations 
PageRank 
References 
9
0.60
17
Authors
2
Name
Order
Citations
PageRank
Andreas Karrenbauer113320.21
Antti Oulasvirta23131217.78