Search results for "Heuristics"
showing 10 items of 191 documents
Contributions of Response Processes Analysis to the Validation of an Assessment of Higher Education Students’ Competence in Business and Economics
2017
Higher education domains such as Business and Economics (B&E) generally lack evidence that standardized tests of competency actually assess those aspects of knowledge and reasoning that constitute important targets for learning and instruction. The construction of such a validity argument benefits from a framework to guide the collection of relevant evidence regarding the interpretive meaning of tests results, especially with respect to instruction and learning in B&E. Response processes analysis provides much needed evidence within such a validity argument. The present paper illustrates application of such a framework and the use of response processes analysis for assessment in the B&E hig…
Shared online spreadsheets and hidden profiles: Technological effects on dyad decision strategy
2012
We report a study in which dyads use Instant Messaging to agree a preference among a set of three apartments. The information given to participants is partially overlapping, and contains a ''hidden profile'' (HP), such that a single apartment emerges as the best according to an unweighted sum of feature values only if dyad members pool information that is presented to only one of them. When dyads were additionally provided with a shared online spreadsheet, their decision strategy was more likely to be compensatory and relatively exhaustive, even if the distribution of importance among the cues in which the apartments vary meant that a ''fast and frugal'' heuristic such as take-the-best woul…
Social Influence Maximization in Hypergraphs
2021
This work deals with a generalization of the minimum Target Set Selection (TSS) problem, a key algorithmic question in information diffusion research due to its potential commercial value. Firstly proposed by Kempe et al., the TSS problem is based on a linear threshold diffusion model defined on an input graph with node thresholds, quantifying the hardness to influence each node. The goal is to find the smaller set of items that can influence the whole network according to the diffusion model defined. This study generalizes the TSS problem on networks characterized by many-to-many relationships modeled via hypergraphs. Specifically, we introduce a linear threshold diffusion process on such …
A tabu search algorithm for the bipartite drawing problem
1998
Graphs are used to represent reality in several areas of knowledge. This has generated considerable interest in graph drawing algorithms. Arc crossing minimization is a fundamental aesthetic criterion to obtain a readable map of a graph. The problem of minimizing the number of arc crossings in a bipartite graph (BDP) is NP-complete. In this paper we present a Tabu Search (TS) scheme for the BDP. Several algorithms can be obtained with this scheme by implementing different evaluators in the move definitions. In this paper we propose two variants. Computational results are reported on a set of 300 randomly generated test problems. The two algorithms have been compared with the best heuristics…
Optimizing the level of service quality of a bike-sharing system
2016
Public bike-sharing programs have been deployed in hundreds of cities worldwide, improving mobility in a socially equitable and environmentally sustainable way. However, the quality of the service is drastically affected by imbalances in the distribution of bicycles among stations. We address this problem in two stages. First, we estimate the unsatisfied demand (lack of free lockers or lack of bicycles) at each station for a given time period in the future and for each possible number of bicycles at the beginning of the period. In a second stage, we use these estimates to guide our redistribution algorithms. Computational results using real data from the bike-sharing system in Palma de Mall…
Combining content extraction heuristics
2008
The main text content of an HTML document on the WWW is typically surrounded by additional contents, such as navigation menus, advertisements, link lists or design elements. Content Extraction (CE) is the task to identify and extract the main content. Ongoing research has spawned several CE heuristics of different quality. However, so far only the Crunch framework combines several heuristics to improve its overall CE performance. Since Crunch, though, many new algorithms have been formulated. The CombinE system is designed to test, evaluate and optimise combinations of CE heuristics. Its aim is to develop CE systems which yield better and more reliable extracts of the main content of a web …
Variable Neighborhood Search for the Vertex Separation Problem
2012
The vertex separation problem belongs to a family of optimization problems in which the objective is to nd the best separator of vertices or edges in a generic graph. This optimization problem is strongly related to other well-known graph problems; such as the Path-Width, the Node Search Number or the Interval Thickness, among others. All of these optimization problems are NP-hard and have practical applications in VLSI, computer language compiler design or graph drawing. Up to know, they have been generally tackled with exact approaches, presenting polynomial-time algorithms to obtain the optimal solution for speci c types of graphs. However, in spite of their practical applications, these…
Usability of ERP Error Messages
2014
Usability of complex information system like enterprise resource planning (ERP) system is still a challenging area. This is why many usability problems have been found in the ERP system. In this article, we tried to highlight the 21 usability problems in ERP error messages by using Nielsen’s heuristics and inquiry questionnaire methods. Nielsen’s heuristics is a better for finding a large number of unique usability problems in different areas. The inquiry questionnaire method has some constraints, but it is useful for comprehending how the actual end-users perceive an application. peerReviewed
Heuristics for a Real-World Mail Delivery Problem
2011
We are solving a mail delivery problem by combining exact and heuristic methods. The problem is a tactical routing problem as routes for all postpersons have to be planned in advance for a period of several months. As for many other routing problems, the task is to construct a set of feasible routes serving each customer exactly once at minimum cost. Four different modes (car, moped, bicycle, and walking) are available, but not all customers are accessible by all modes. Thus, the problem is characterized by three interdependent decisions: the clustering of customers into districts, the choice of a mode for each district, and the routing of the postperson through its district. We present a t…
From Heuristics to Humble Theories in Physics Education: The Case of Modelling Personal Appropriation of Thermodynamics in Naturalistic Settings
2014
This paper concerns the analysis of data collected during the implementation of a teaching proposal on thermodynamics in a class of 20 students (17 year-olds) of a scientifically-oriented secondary school in Italy. After a brief presentation of the teaching proposal design and of the notion of learning environment as properly complex territory, the results of two levels of analysis are discussed. The first level regards a phenomenological (bottom-up) analysis of a selection of individual interviews to students. The analysis allowed us: i) to reconstruct how different students approached the study of thermodynamics; ii) to show in what sense we can infer, in the words of Confrey, that the te…