scholarly journals Switching target templates decreases search efficiency in efficient search

2021 ◽  
Vol 21 (9) ◽  
pp. 2401
Author(s):  
Zuhan Lin ◽  
Gavin J.P. Ng ◽  
Yaoyun Cui ◽  
Simona Buetti ◽  
Alejandro Lleras
2016 ◽  
Vol 42 (6) ◽  
pp. 821-836 ◽  
Author(s):  
Heinrich René Liesefeld ◽  
Rani Moran ◽  
Marius Usher ◽  
Hermann J. Müller ◽  
Michael Zehetleitner

Author(s):  
Vishnu Sharma ◽  
Vijay Singh Rathore ◽  
Chandikaditya Kumawat

Software reuse can improve software quality with the reducing cost and development time. Systematic reuse plan enhances cohesion and reduces coupling for better testability and maintainability. Software reuse approach can be adopted at the highest extent if relevant software components can be easily searched, adapted and integrated into new system. Large software industries hold their own well managed component libraries containing well tested software component with the project category based classification .Access to these repositories are very limited. Software reuse is facing so many problems and still not so popular. This is due to issues of general access, efficient search and adoption of software component. This paper propose a framework which resolves all of the above issues with providing easy access to components, efficient incremental semantics based search, repository management, versioning of components.


2020 ◽  
Author(s):  
Anna Nowakowska ◽  
Alasdair D F Clarke ◽  
Jessica Christie ◽  
Josephine Reuther ◽  
Amelia R. Hunt

We measured the efficiency of 30 participants as they searched through simple line segment stimuli and through a set of complex icons. We observed a dramatic shift from highly variable, and mostly inefficient, strategies with the line segments, to uniformly efficient search behaviour with the icons. These results demonstrate that changing what may initially appear to be irrelevant, surface-level details of the task can lead to large changes in measured behaviour, and that visual primitives are not always representative of more complex objects.


2009 ◽  
Author(s):  
Melissa R. Beck ◽  
Maura C. Lohrenz ◽  
J. G. Trafton

2012 ◽  
Vol 178-181 ◽  
pp. 1802-1805
Author(s):  
Chun Yu Ren

The paper is focused on the Multi-cargo Loading Problem (MCLP). Tabu search algorithm is an algorithm based on neighborhood search. According to the features of the problem, the essay centered the construct initial solution to construct neighborhood structure. For the operation, 1-move and 2-opt were applied, it can also fasten the speed of convergence, and boost the search efficiency. Finally, the good performance of this algorithm can be proved by experiment calculation and concrete examples.


Sign in / Sign up

Export Citation Format

Share Document