135,737 Hits in 7.0 sec

Studying Bibliometrics-Based Heuristics (BBHs): A New Research Program on the use of Bibliometrics in Research Evaluation

Lutz Bornmann
2020 Scholarly Assessment Reports  
Bornmann and Marewski (2019) suggest that these and similar questions can be empirically answered by studying the evaluative use of bibliometrics within the heuristics research program conceptualized by  ...  How do decision makers in science use bibliometric indicators and how do they rely on the indicators? Could bibliometric indicators replace the decision makers' judgments (partly or completely)?  ...  The authors conceptualize the use of bibliometrics in research evaluation based on the heuristics research program and introduce the term BBH.  ... 
doi:10.29024/sar.22 fatcat:5tdqtiul5nfi5n4t7rfto7bxoi

Bibliometrics-based decision trees (BBDTs) based on bibliometrics-based heuristics (BBHs): Visualized guidelines for the use of bibliometrics in research evaluation

Lutz Bornmann
2019 Quantitative Science Studies  
In so doing, heuristics can not only reduce complexity, but also boost the accuracy of decisions, their speed, and transparency.  ...  The BBDT exemplarily presented in this paper can be used as a guidance to find an answer on the question in which situations simple indicators such as mean citation rates are reasonable and in which situations  ...  The use of simple citation rates for research evaluation might lead to distorted world views if units are active in multiple fields.  ... 
doi:10.1162/qss_a_00012 fatcat:b6y7e7bsj5f65kablgbcsd3hca

Natural frequencies improve Bayesian reasoning in simple and complex inference tasks

Ulrich Hoffrage, Stefan Krauss, Laura Martignon, Gerd Gigerenzer
2015 Frontiers in Psychology  
In Study 2, we show that teaching natural frequencies for simple tasks with one dichotomous cue and two hypotheses leads to a transfer of learning to complex tasks with three cue values and two cues, with  ...  Yet all the research and applications so far have been limited to situations where one dichotomous cue is used to infer which of two hypotheses is true.  ...  That is, it is largely sufficient to instruct people in using natural frequencies in the basic task in order to ensure a generalization to and solution of complex tasks, as long as the information in both  ... 
doi:10.3389/fpsyg.2015.01473 pmid:26528197 pmcid:PMC4604268 fatcat:brtkq7avzvgohlz6pgfffzbxx4

Coordinating Procedural and Conceptual Knowledge to Make Sense of Word Equations: Understanding the complexity of a 'simple' completion task at the learner's resolution

Keith S. Taber, Pat Bricheno
2009 International Journal of Science Education  
Empfohlene Zitierung / Suggested Citation: Taber, Keith Stephen ; Bricheno, Pat: Coordinating procedural and conceptual knowledge to make sense of word equations: understanding the complexity of a 'simple  ...  ' chemical task at the learner's resolution.  ...  In particular, the present research suggests that this (apparently) simple type of task may best be approached by some form of metastrategy -such as that offered in figure 1.  ... 
doi:10.1080/09500690802326243 fatcat:oucw5ufyp5alxh4xwywz2bzfoi

AFSCN scheduling: How the problem and solution have evolved

Laura Barbulescu, Adele Howe, Darrell Whitley
2006 Mathematical and computer modelling  
Our evaluation of solutions focus on three algorithms: local search, Gooley's algorithm from AFIT, and the Genitor genetic algorithm.  ...  We compared data sets from 1992 and from 2002/2003 and found significant differences in the problems.  ...  The task requests in the current data interact in more complex ways, and the simple heuristic cannot always find the best solution.  ... 
doi:10.1016/j.mcm.2005.12.004 fatcat:c75lm7t3dbggffv6sopxn445eq

Confidence in heuristic solutions?

Kenneth Carling, Xiangli Meng
2015 Journal of Global Optimization  
The optimum is sought iteratively and pre-setting the number of iterations dominates in operations research applications, which implies that the quality of the solution cannot be ascertained.  ...  Deterministic bounds offer a mean of ascertaining the quality, but such bounds are available for only a limited number of heuristics and the length of the interval may be difficult to control in an application  ...  Acknowledgement We are grateful to Mengjie Han, Johan Håkansson and Daniel Wikström for comments on an earlier draft of the paper.  ... 
doi:10.1007/s10898-015-0293-4 fatcat:m2qjhjok3bgqrekznjyvcwgix4

Unfolding the simple heuristics of smart solution development

Tuomas Huikkola, Marko Kohtamäki, Rodrigo Rabetino, Hannu Makkonen, Philipp Holtkamp
2021 Journal of Service Management  
(SSD) process.Design/methodology/approachThe study uses an in-depth single case research strategy and 25 senior manager interviews to understand the application of simple rules in smart solution development.FindingsThe  ...  in smart solution development in a more agile manner.Originality/valueThe study comprises one of the first attempts to investigate managerial heuristics in the context of SSD and puts forward a plea for  ...  The authors have 10þ years of servitization research experience Storbacka (2011) The authors have collaborated with the firm for over ten years and are involved in different business-related research  ... 
doi:10.1108/josm-11-2020-0422 fatcat:kv5gu7emo5eqhlk5m6xq2hcqci

The Optimality of Satisficing Solutions [article]

Othar Hansson, Andy Mayer
2013 arXiv   pre-print
This paper addresses a prevailing assumption in single-agent heuristic search theory- that problem-solving algorithms should guarantee shortest-path solutions, which are typically called optimal.  ...  Optimality implies a metric for judging solution quality, where the optimal solution is the solution with the highest quality.  ...  In addition, we would like to thank Rich Korf, Beth Mayer, and Risto Miikkulainen who commented on earlier drafts of this paper.  ... 
arXiv:1304.2356v1 fatcat:aftywgblnrg5zmxn4jycjq3a3m

Expected Solution Quality

John L. Bresina, Mark Drummond, Keith Swanson
1995 International Joint Conference on Artificial Intelligence  
practical telescope scheduling problem The method addresses the important and difficult issue of how to meaningfully evaluate the performance of a scheduler on a constrained optimization problem for which  ...  provides a useful characterization of a scheduling problem, and it also provides a background against which (scheduler performance can be meaningfully evaluated ESQ provides a unitless measure that combines  ...  Acknowledgments We would like to thank Will Edgington and Ellen Drascher for their significant contributions towards making the automatic telescope software a reality For their helpful feedback on this  ... 
dblp:conf/ijcai/BresinaDS95 fatcat:vnwugpjkbrcgrirtpbnag4dd6e

Incorporating Machine Learning to Evaluate Solutions to the University Course Timetabling Problem [article]

Patrick Kenekayoro
2020 arXiv   pre-print
Evaluating solutions to optimization problems is arguably the most important step for heuristic algorithms, as it is used to guide the algorithms towards the optimal solution in the solution search space  ...  Up to 97 percent of the time, the traditional evaluation function agreed with the supervised learning regression model on the result of comparison of the quality of pair of solutions to the university  ...  Introduction Evaluating solutions to optimization problems is one of the most frequent and arguably the most important operation in meta-heuristic algorithms, as evaluation is necessary to guide meta-heuristic  ... 
arXiv:2010.00826v1 fatcat:phprx24ujjcddnvkahyplqa7mq

Divide and conquer evolutionary TSP solution for vehicle path planning

Ryan J. Meuth, Donald C. Wunsch
2008 2008 IEEE Congress on Evolutionary Computation (IEEE World Congress on Computational Intelligence)  
The robotic area coverage task is concerned with moving a vehicle with an effector, or sensor, through the task space such that the sensor passes over every point in the space.  ...  For covering complex areas, back and forth paths are inadequate.  ...  This has been deeply researched in literature, as efficient solutions have wide ranging applications in domains such as vehicle routing and job-scheduling.  ... 
doi:10.1109/cec.2008.4630868 dblp:conf/cec/MeuthW08 fatcat:6mrl2wqacrhhnlm7dlsathn5xi

Search Algorithms for m Best Solutions for Graphical Models

Rina Dechter, Natalia Flerova, Radu Marinescu
We extend both algorithms to optimization tasks over graphical models (e.g., Weighted CSP and MPE in Bayesian networks), provide complexity analysis and an empirical evaluation.  ...  benefit greatly when the heuristic evaluation function has increased accuracy.  ...  the extension of a BFS algorithm, including A*, to the task of finding the m best solutions seems simple: rather than terminating with the first solution found, the algorithm continues searching until  ... 
doi:10.1609/aaai.v26i1.8405 fatcat:p7cmh4yv45hlvoccgpwnluh4sa

AI solutions for drafting in Magic: the Gathering [article]

Henry N. Ward, Daniel J. Brooks, Dan Troha, Bobby Mills, Arseny S. Khakhalin
2021 arXiv   pre-print
We benchmark their ability to emulate human drafting, and show that the deep neural network agent outperforms other agents, while the Naive Bayes and expert-tuned agents outperform simple heuristics.  ...  This work helps to identify next steps in the creation of humanlike drafting agents, and can serve as a benchmark for the next generation of drafting bots.  ...  RaredraftBot: simple heuristics As a more realistic baseline, RaredraftBot emulates a drafting strategy used by inexperienced human players by drafting the rarest card in each pack.  ... 
arXiv:2009.00655v3 fatcat:lkzlfwgb5ragrkayhygraxuihi

Parallel Implementations of Candidate Solution Evaluation Algorithm for N-Queens Problem

Jianli Cao, Zhikui Chen, Yuxin Wang, He Guo, Leo Y. Zhang
2021 Complexity  
The N-Queens problem plays an important role in academic research and practical application. Heuristic algorithm is often used to solve variant 2 of the N-Queens problem.  ...  In the process of solving, evaluation of the candidate solution, namely, fitness function, often occupies the vast majority of running time and becomes the key to improve speed.  ...  Acknowledgments is work was supported by the National Natural Science Foundation of China (61672123).  ... 
doi:10.1155/2021/6694944 fatcat:aamswkg5efgvbio2k5yse6be2a

An Overview of Current Ontology Meta-Matching Solutions

Jorge Martinez
2017 Figshare  
We think that an overview of the problem and an analysis of the existing state-of-the-art solutions will help researchers and practitioners to identify the most appropriate specific features and global  ...  Nowadays, there are a lot of techniques and tools for addressing the ontology matching problem; however, the complex nature of this problem means that the existing solutions are unsatisfactory.  ...  This work has been funded by the Spanish Ministry of Innovation and Science through the project: ICARIA: From Semantic Web to Systems Biology, Project Code: TIN2008-04844 and by Regional Government of  ... 
doi:10.6084/m9.figshare.5628532.v1 fatcat:sdeabw5lbnaexdmllbfo4c7jhy
« Previous Showing results 1 — 15 out of 135,737 results