14518 search results - page 237 / 2904 » Two Problems for Sophistication |
134
Voted
COMPSAC
2009
IEEE
14 years 10 months ago
2009
IEEE
Click based graphical passwords that use background images suffer from hot-spot problem. Previous graphical password schemes based on recognition of images do not have a sufficient...
ENDM
2010
14 years 10 months ago
2010
This paper deals with an NP-hard bi-objective one-machine problem with ready times involving maximum lateness and unit family setup cost objectives. Considering separately both ob...
117
Voted
SIAMJO
2010
14 years 7 months ago
2010
Quadratic assignment problems (QAPs) with a Hamming distance matrix for a hypercube or a Manhattan distance matrix for a rectangular grid arise frequently from communications and ...
126
Voted
CORR
2012
Springer
13 years 8 months ago
2012
Springer
Most theoretical definitions about the complexity of manipulating elections focus on the decision problem of recognizing which instances can be successfully manipulated, rather t...
118
click to vote
CDC
2008
IEEE
15 years 7 months ago
2008
IEEE
— This paper analyzes two classes of consensus algorithms in presence of bounded measurement errors. The protocols taken into account adopt an updating rule based either on const...