Old and new algorithms for minimal coverability sets
10.3233/FI-2014-1002
Saved in:
Main Authors: | Valmari, A., Hansen, H. |
---|---|
Other Authors: | TEMASEK LABORATORIES |
Format: | Article |
Published: |
2016
|
Online Access: | http://scholarbank.nus.edu.sg/handle/10635/128911 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | National University of Singapore |
Similar Items
-
Covering the recursive sets
by: Kjos-Hanssen B., et al.
Published: (2020) -
Packet scheduling based on set covering problem using greedy algorithm
by: Chatchanan Jandaeng
Published: (2014) -
New approach to alarm processing in power systems based on the set covering theory and a refined genetic algorithm
by: Wen, F., et al.
Published: (2014) -
A fully dynamic algorithm for k-regret minimizing sets
by: WANG, Yanhao, et al.
Published: (2021) -
G-PRIMER: Greedy algorithm for selecting minimal primer set
by: Wang, J., et al.
Published: (2013)