Ben Niu 0002

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Mijat Kustudic

> Home > Persons > Ben Niu 0002

Publications

2023
[c133]
- view
  authority control:
- export record
  dblp key:
  - conf/swarm/KustudicGLN23
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/swarm/KustudicGLN23
Mijat Kustudic, Maja Gulan, Junrui Lu, Ben Niu:
Analysis of SIR Compartmental Model Results with Different Update Strategies. ICSI (2) 2023: 156-167
2022
[j66]
- view
  authority control:
- export record
  dblp key:
  - journals/ijis/NiuXZK22
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ijis/NiuXZK22
Ben Niu, Bowen Xue, Tianwei Zhou, Mijat Kustudic:
Aviation maintenance technician scheduling with personnel satisfaction based on interactive multi-swarm bacterial foraging optimization. Int. J. Intell. Syst. 37(1): 723-747 (2022)
2020
[j47]
- view
  authority control:
- export record
  dblp key:
  - journals/apin/HaoYLKN20
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/apin/HaoYLKN20
Zhiyong Hao, Chen Yang, Lei Liu, Mijat Kustudic, Ben Niu:
Exploiting skew-adaptive delimitation mechanism for learning expressive classification rules. Appl. Intell. 50(3): 746-758 (2020)
2019
[c112]
- view
  authority control:
- export record
  dblp key:
  - conf/bic-ta/Kustudic019
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/bic-ta/Kustudic019
Mijat Kustudic, Ben Niu:
A Bacterial Foraging Framework for Agent Based Modeling. BIC-TA (1) 2019: 727-738

a service of

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.