![]() |
CiteULike | ![]() |
mobitan's CiteULike | ![]() |
![]() |
|
![]() |
Register | ![]() |
Log in | ![]() |
Optimization of the keyboard arrangement problem using an Ant Colony algorithmby: J. Eggers
|
Reviews
[Write a review of this article]
Find related articles from these CiteULike users
Find related articles with these CiteULike tags
Posting History
AbstractIn order to solve the problem of the arrangement of letters on a computer keyboard, an abstract representation of a keyboard is introduced and an evaluation function taking account of ergonomic criteria is proposed. It results in a new optimization problem that we name the keyboard arrangement problem. Based on the generic framework of Ant Colony optimization, an algorithm is developed and applied to this problem. New effective keyboard arrangements are deduced for several languages. Comparisons are made with standard manually optimized keyboards.
BibTeX record
RIS record