A parallel hybrid method for solving the satisfiability (SAT) problem that combines cellular genetic algorithms (GAs) and the random walk SAT (WSAT) strategy of greedy SAT (GSAT) …
Монография содержит авторское изложение одного из современных направлений исследований-криптографии, основанной на группах (в английской терминологии …
F Esponda, ES Ackley, S Forrest, P Helman - International Conference on …, 2004 - Springer
The benefits of negative detection for obscuring information are explored in the context of Artificial Immune Systems (AIS). AIS based on string matching have the potential for an extra …
The paper introduces the concept of a negative database, in which a set of records DB is represented by its complement set. That is, all the records not in DB are represented, and …
This paper proposes DeepSynth, a method for effective training of deep reinforcement learning agents when the reward is sparse or non-Markovian, but at the same time progress …
D Zhao, W Luo - Engineering Applications of Artificial Intelligence, 2017 - Elsevier
In this paper, a novel one-time password authentication scheme based on the negative database (NDB) is proposed. The authentication data, which involve a user password and …
Abstract In 2007, the US National Institute of Standards and Technology (NIST) announced a public contest aiming at the selection of a new standard for a cryptographic hash function …
S Szeider - Journal of Automated Reasoning, 2005 - Springer
We study the parameterized complexity of detecting small backdoor sets for instances of the propositional satisfiability problem (SAT). The notion of backdoor sets has been recently …
In this paper, we investigate how adaptive operator selection techniques are able to efficiently manage the balance between exploration and exploitation in an evolutionary …