26354 search results - page 41 / 5271 » How we refactor, and how we know it |
121
click to vote
JGT
2006
15 years 6 months ago
2006
We study the number F[n; k] of n-vertex graphs that can be written as the edgeunion of k-vertex cliques. We obtain reasonably tight estimates for F[n; k] in the cases (i) k = n-o(...
144
click to vote
ENTCS
2002
15 years 5 months ago
2002
We give a short description of Hybrid, a new tool for interactive theorem proving, s introduced in [4]. It provides a form of Higher Order Abstract Syntax (HOAS) combined consiste...
159
click to vote
FUN
2007
Springer
16 years 8 days ago
2007
Springer
We analyse transports between leaves in an edge-weighted tree. We prove under which conditions there exists a transport matching the weights of a given tree. We use this to compute...
155
click to vote
HIP
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. We would like to quantify the assurance contained in an authentication secret. For instance, how much assurance does a customer convey to a bank by revealing that his Per...
140
click to vote
HICSS
2003
IEEE
15 years 11 months ago
2003
IEEE
In this study, we empirically explore how task performance and domain-specific self-efficacy influence the perceived ease of use (PEU) of object-oriented techniques. We hypothesiz...