The Hungarian Method for the Assignment Problem

Kuhn, Harold W.

doi:10.1007/978-3-540-68279-0_2

Cited by 1,200 publications

(1,306 citation statements)

References 0 publications

Supporting

Mentioning

1,287

Contrasting

Unclassified

Order By: Relevance

“…It makes use of the Levenshtein edit distance [19] to track line edits, and tf-idf [34] and cosine similarity [31] to track line movements. It also uses the Hungarian algorithm [18] to find the optimal matching of lines across versions. Compared to previous work, our implementation can also improve precision by using coverage information to filter non-executable lines.…”

Section: Covrig Infrastructurementioning

confidence: 99%

Covrig: a framework for the analysis of code, test, and coverage evolution in real software

Marinescu

Hošek

Cadar

2014

Proceedings of the 2014 International Symposium on Software Testing and Analysis

View full text Add to dashboard Cite

Software repositories provide rich information about the construction and evolution of software systems. While static data that can be mined directly from version control systems has been extensively studied, dynamic metrics concerning the execution of the software have received much less attention, due to the inherent difficulty of running and monitoring a large number of software versions.In this paper, we present Covrig, a flexible infrastructure that can be used to run each version of a system in isolation and collect static and dynamic software metrics, using a lightweight virtual machine environment that can be deployed on a cluster of local or cloud machines.We use Covrig to conduct an empirical study examining how code and tests co-evolve in six popular open-source systems. We report the main characteristics of software patches, analyse the evolution of program and patch coverage, assess the impact of nondeterminism on the execution of test suites, and investigate whether the coverage of code containing bugs and bug fixes is higher than average.

show abstract

Section: Covrig Infrastructurementioning

confidence: 99%

Covrig: a framework for the analysis of code, test, and coverage evolution in real software

Marinescu

Hošek

Cadar

2014

Proceedings of the 2014 International Symposium on Software Testing and Analysis

View full text Add to dashboard Cite

show abstract

“…We matched the group centroids between 10 solutions using Hungarian algorithm [23]. We explored the reproducibility and stability of each cluster to define common-level iCAPs amongst our samples.…”

Section: Group-level Clusteringmentioning

confidence: 99%

Total-activation regularized deconvolution of resting-state fMRI leads to reproducible networks with spatial overlap

Karahanoğlu

Ville

2016

2016 24th European Signal Processing Conference (EUSIPCO)

View full text Add to dashboard Cite

Abstract-Spontaneous activations in resting-state fMRI have been shown to corroborate recurrent intrinsic functional networks. Recent studies have explored integration of brain function in terms of spatially overlapping networks. We have proposed a method to recover not only spatially but also temporally overlapping networks, which we named innovation-driven coactivation patterns (iCAPs). These networks are driven by the sparse innovation signals recovered from Total Activation (TA), a spatiotemporal regularization framework for fMRI deconvolution. The fMRI data is processed with TA, which uses the inverse of the hemodynamic response function-as a linear differential operator-combined with the derivative in the regularization with`1-norm. As a result, sparse innovation signals are reconstructed as the deconvolved fMRI time series. Temporal clustering of innovation signals lead to iCAPs. In this work, we investigate the reproducible iCAPs in individuals with relapsingremitting multiple sclerosis and healthy volunteers.

show abstract

“…Algorithms that are able to solve problems defined in this way are immunological techniques, which are pretty good for problems of small and average size. However the most popular and widely applied method is the Hungarian algorithm, which in general is the best method of complexity O(n 3 ) (Kuhn, 1955). However there is no such universal method for multidimensional form of assignment problem, which is a little inconvenient, but on the other hand it has an ideal setting in which one can demonstrate skills and is an area for some improvements and analysis based on non-deterministic methods, heuristics and biologically inspired techniques.…”

Section: N -Dimensional Assignment Problemmentioning

confidence: 99%

Ant Algorithm for AP-N Aimed at Optimization of Complex Systems

Mikulik

Zajdel

2010

dmms

View full text Add to dashboard Cite

Abstract. Assignment Problem (AP), which is well known combinatorial problem, has been studied extensively in the course of many operational and technical researches. It has been shown to be NP-hard for three or more dimensions and a few non-deterministic methods have been proposed to solve it. This paper pays attention on new heuristic search method for the n-dimensional assignment problem, based on swarm intelligence and comparing results with those obtained by other scientists. It indicates possible direction of solutions of problems and presents a way of behaviour using ant algorithm for multidimensional optimization complex systems. Results of researches in the form of computational simulations outcomes are presented.

show abstract

The Hungarian Method for the Assignment Problem

Cited by 1,200 publications

References 0 publications

Covrig: a framework for the analysis of code, test, and coverage evolution in real software

Covrig: a framework for the analysis of code, test, and coverage evolution in real software

Total-activation regularized deconvolution of resting-state fMRI leads to reproducible networks with spatial overlap

Ant Algorithm for AP-N Aimed at Optimization of Complex Systems

Contact Info

Product

Resources

About