Wyniki wyszukiwania dla: COLLUSION ATTACK

• ENVIRONMENTAL SCIENCE AND POLLUTION RESEARCH

  Czasopisma

  ISSN: 0944-1344 , eISSN: 1614-7499

• ENVIRONMENTAL POLLUTION

  Czasopisma

  ISSN: 0269-7491 , eISSN: 1873-6424

• MARINE POLLUTION BULLETIN

  Czasopisma

  ISSN: 0025-326X , eISSN: 1879-3363

• WATER AIR AND SOIL POLLUTION

  Czasopisma

  ISSN: 0049-6979 , eISSN: 1573-2932

• Pollution

  Czasopisma

  ISSN: 2383-451X , eISSN: 2383-4501

• Ship Collision Risk Assessment Based on Collision Detection Algorithm

  Publikacja

  • D. Liu
  • G. Shi

  - IEEE Access - Rok 2020

  Pełny tekst do pobrania w serwisie zewnętrznym

• Adversarial attack algorithm for traffic sign recognition

  Publikacja

  • J. Wang
  • L. Shi
  • Y. Zhao
  • H. Zhang
  • E. Szczerbicki

  - MULTIMEDIA TOOLS AND APPLICATIONS - Rok 2022

  Deep learning suffers from the threat of adversarial attacks, and its defense methods have become a research hotspot. In all applications of deep learning, intelligent driving is an important and promising one, facing serious threat of adversarial attack in the meanwhile. To address the adversarial attack, this paper takes the traffic sign recognition as a typical object, for it is the core function of intelligent driving. Considering...

  Pełny tekst do pobrania w serwisie zewnętrznym

• Decision Support Based on Optimal Collision Avoidance Path and Collision Risk

  Publikacja

  • D. Liu
  • G. Shi
  • W. Li

  - Rok 2018

  Pełny tekst do pobrania w serwisie zewnętrznym

• Collision-Free Network Exploration

  Publikacja

  • J. Czyzowicz
  • D. Dereniowski
  • L. Gąsieniec
  • R. Klasing
  • A. Kosowski
  • D. Pająk

  - Rok 2014

  A set of mobile agents is placed at different nodes of a n-node network. The agents synchronously move along the network edges in a collision-free way, i.e., in no round may two agents occupy the same node. In each round, an agent may choose to stay at its currently occupied node or to move to one of its neighbors. An agent has no knowledge of the number and initial positions of other agents. We are looking for the shortest possible...

  Pełny tekst do pobrania w serwisie zewnętrznym

• Collision-free network exploration

  Publikacja

  • J. Czyzowicz
  • D. Dereniowski
  • L. Gąsieniec
  • R. Klasing
  • A. Kosowski
  • D. Pająk

  - JOURNAL OF COMPUTER AND SYSTEM SCIENCES - Rok 2017

  Mobile agents start at different nodes of an n-node network. The agents synchronously move along the network edges in a collision-free way, i.e., in no round two agents may occupy the same node. An agent has no knowledge of the number and initial positions of other agents. We are looking for the shortest time required to reach a configuration in which each agent has visited all nodes and returned to its starting location. In...

  Pełny tekst do pobrania w portalu