1191 search results - page 41 / 239 » Completeness and Performance Of The APO Algorithm |
CCS
2008
ACM
13 years 9 months ago
2008
ACM
We present a new verification algorithm for security protocols that allows for unbounded verification, falsification, and complete characterization. The algorithm provides a numbe...
IANDC
2010
13 years 6 months ago
2010
We show that the two NP-complete problems of Dodgson Score and Young Score have differing computational complexities when the winner is close to being a Condorcet winner. On the ...
CCR
2006
13 years 7 months ago
2006
Users typically want their flows to complete as quickly as possible: They want a web-page to download quickly, or a file transfer to complete as rapidly as possible. In other words...
ICSE
2012
IEEE-ACM
11 years 10 months ago
2012
IEEE-ACM
—Integrated Development Environments (IDEs) have come to perform a wide variety of tasks on behalf of the programmer, refactoring being a classic example. These operations have u...
BVAI
2005
Springer
14 years 1 months ago
2005
Springer
Inspired by psychophysical studies of the human cognitive abilities we propose a novel aspect and a method for performance evaluation of contour based shape recognition algorithms ...