Sciweavers

455 search results - page 26 / 91
» Understanding Counterexamples with explain
Sort
View
CSJM
2008
65views more  CSJM 2008»
14 years 9 months ago
A New Attempt On The F5 Criterion
Faug`ere's criterion used in the F5 algorithm is still not understand and thus there are not many implementations of this algorithm. We state its proof using syzygies to expl...
Christian Eder
ISSTA
2012
ACM
13 years 1 months ago
A human study of patch maintainability
Identifying and fixing defects is a crucial and expensive part of the software lifecycle. Measuring the quality of bug-fixing patches is a difficult task that affects both func...
Zachary P. Fry, Bryan Landau, Westley Weimer
89
Voted
ICFP
2001
ACM
15 years 11 months ago
Compositional Explanation of Types and Algorithmic Debugging of Type Errors
The type systems of most typed functional programming languages are based on the Hindley-Milner type system. A practical problem with these type systems is that it is often hard t...
Olaf Chitil
91
Voted
WEBI
2005
Springer
15 years 4 months ago
Providing Expert Advice by Analogy for On-Line Help
One of the principal problems of online help is the mismatch between the specialized knowledge and technical vocabulary of experts who are providing the help, and the relative na...
Henry Lieberman, Ashwani Kumar
ECIS
2011
13 years 11 months ago
Analyzing best practice and critical success factors in a health information system case - are there any shortcuts to successful
This paper discusses critical success factors (CSF) and best practice in relation to IT implementation in the health sector. We have studied a University Hospital’s implementati...
Karin Axelsson, Ulf Melin, Fredrik Söderstr&o...