The single-finger keyboard layout problem
暂无分享,去创建一个
Mauro Dell'Amico | Manuel Iori | Roberto Montanari | José Carlos Díaz Díaz | M. Iori | R. Montanari | M. Dell’Amico | J. Díaz | M. dell’Amico
[1] Fred W. Glover,et al. Tabu Search - Part I , 1989, INFORMS J. Comput..
[2] Ravindra S. Goonetilleke,et al. A heuristic-based approach to optimize keyboard design for single-finger keying applications , 2006 .
[3] Corso Elvezia. Ant Colonies for the QAP , 1997 .
[4] Fred W. Glover,et al. A user's guide to tabu search , 1993, Ann. Oper. Res..
[5] I.,et al. Fitts' Law as a Research and Design Tool in Human-Computer Interaction , 1992, Hum. Comput. Interact..
[6] Thomas E. Vollmann,et al. An Experimental Comparison of Techniques for the Assignment of Facilities to Locations , 1968, Oper. Res..
[7] T. L. Ward,et al. Solving Quadratic Assignment Problems by ‘Simulated Annealing’ , 1987 .
[8] David Connolly. An improved annealing scheme for the QAP , 1990 .
[9] Jadranka Skorin-Kapov,et al. Tabu Search Applied to the Quadratic Assignment Problem , 1990, INFORMS J. Comput..
[10] Roberto Battiti,et al. The Reactive Tabu Search , 1994, INFORMS J. Comput..
[11] R. Battiti,et al. Simulated annealing and Tabu search in the long run: A comparison on QAP tasks☆ , 1994 .
[12] David Rempel,et al. Toward a more humane keyboard , 1992, CHI.
[13] M Dorigo,et al. Ant colonies for the quadratic assignment problem , 1999, J. Oper. Res. Soc..
[14] Monique Guignard-Spielberg,et al. A level-2 reformulation-linearization technique bound for the quadratic assignment problem , 2007, Eur. J. Oper. Res..
[15] F. Glover,et al. Multi-Start Tabu Search and Diversification Strategies for the Quadratic Assignment Problem , 2006 .
[16] Ric,et al. Adaptive Memories for the Quadratic Assignment Problem , 1997 .
[17] C. McDiarmid. SIMULATED ANNEALING AND BOLTZMANN MACHINES A Stochastic Approach to Combinatorial Optimization and Neural Computing , 1991 .
[18] Mark S. Sanders,et al. Human Factors in Engineering and Design , 2016 .
[19] Vittorio Maniezzo,et al. The Ant System Applied to the Quadratic Assignment Problem , 1999, IEEE Trans. Knowl. Data Eng..
[20] Mauro Dell'Amico,et al. Assignment Problems , 1998, IFIP Congress: Fundamentals - Foundations of Computer Science.
[21] I. Scott MacKenzie,et al. Entry for Mobile Computing : Models and Methods , Theory and Practice , 2002 .
[22] Rainer E. Burkard,et al. Entwurf von Schreibmaschinentastaturen mittels quadratischer Zuordnungsprobleme , 1977, Math. Methods Oper. Res..
[23] Pierre Hansen,et al. Variable Neighborhood Search , 2018, Handbook of Heuristics.
[24] V. Cerný. Thermodynamical approach to the traveling salesman problem: An efficient simulation algorithm , 1985 .
[25] Zvi Drezner,et al. Recent Advances for the Quadratic Assignment Problem with Special Emphasis on Instances that are Difficult for Meta-Heuristic Methods , 2005, Ann. Oper. Res..
[26] Éric D. Taillard,et al. FANT: Fast ant system , 1998 .
[27] É. Taillard,et al. Adaptive memories for the Quadratic Assignment Problems , 1997 .
[28] F. Rendl,et al. A thermodynamically motivated simulation procedure for combinatorial optimization problems , 1984 .
[29] Donald A. Norman,et al. Why Alphabetic Keyboards Are Not Easy to Use: Keyboard Layout Doesn't Much Matter , 1982 .
[30] Jean Cardinal,et al. Designing Small Keyboards Is Hard , 2004, LATIN.
[31] Mauro Dell'Amico,et al. 8. Quadratic Assignment Problems: Algorithms , 2009 .
[32] Charles H. Heider,et al. An n-step, 2-variable search algorithm for the component placement problem , 1973 .
[33] Fred Glover,et al. Tabu Search - Part II , 1989, INFORMS J. Comput..
[34] P. Fitts. The information capacity of the human motor system in controlling the amplitude of movement. , 1954, Journal of experimental psychology.
[35] Allen Newell,et al. The psychology of human-computer interaction , 1983 .
[36] S. Dreyfus,et al. Thermodynamical Approach to the Traveling Salesman Problem : An Efficient Simulation Algorithm , 2004 .
[37] R. William Soukoreff,et al. Text entry for mobile computing: models and methods , 2002 .
[38] Abigail Sellen,et al. A comparison of input devices in element pointing and dragging tasks , 1991, CHI.
[39] Bernard Yannou,et al. Optimization of the keyboard arrangement problem using an Ant Colony algorithm , 2003, Eur. J. Oper. Res..
[40] Yves Crama,et al. Local Search in Combinatorial Optimization , 2018, Artificial Neural Networks.
[41] Alan M. Frieze,et al. Algorithms for assignment problems on an array processor , 1989, Parallel Comput..
[42] C. D. Gelatt,et al. Optimization by Simulated Annealing , 1983, Science.
[43] Fred W. Glover,et al. Multistart Tabu Search and Diversification Strategies for the Quadratic Assignment Problem , 2009, IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans.
[44] Éric D. Taillard,et al. Robust taboo search for the quadratic assignment problem , 1991, Parallel Comput..
[45] Kenneth Sörensen,et al. Multi-objective optimization of mobile phone keymaps for typing messages using a word list , 2007, Eur. J. Oper. Res..
[46] C S Pan,et al. The impact of keyboard design on comfort and productivity in a text-entry task. , 1997, Applied ergonomics.
[47] Marco Dorigo,et al. Ant system: optimization by a colony of cooperating agents , 1996, IEEE Trans. Syst. Man Cybern. Part B.