Breadth search strategies for finding minimal reducts: towards hardware implementation
- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISSN
-
1433-3058
- Extent
-
Online-Ressource
- Language
-
Englisch
- Notes
-
online resource.
- Bibliographic citation
-
Breadth search strategies for finding minimal reducts: towards hardware implementation ; day:19 ; month:3 ; year:2020 ; pages:1-16
Neural computing & applications ; (19.3.2020), 1-16
- Creator
-
Choromański, Mateusz
Grześ, Tomasz
Hońko, Piotr
- Contributor
-
SpringerLink (Online service)
- DOI
-
10.1007/s00521-020-04833-7
- URN
-
urn:nbn:de:101:1-2020061222420763815765
- Rights
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
14.08.2025, 10:54 AM CEST
Data provider
This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Associated
- Choromański, Mateusz
- Grześ, Tomasz
- Hońko, Piotr
- SpringerLink (Online service)
Other Objects (12)
Finding minimum gene subsets with heuristic breadth-first search algorithm for robust tumor classification
On dynamic breadth-first search in external-memory
Orthopedic disease classification based on breadth-first search algorithm
Finding all minimal CURB sets
Finding purifications with minimal entanglement
On finding minimal absent words
Efficient Breadth-First Search on Massively Parallel and Distributed-Memory Machines
Finding Direction in the Search for Selection
Partial Order Reduction for Deep Bug Finding in Synchronous Hardware
The Search for Minimal Search: A Graph-Theoretic Approach
Patent Breadth in an International Setting
Finding qualitative research: an evaluation of search strategies
Finding minimum gene subsets with heuristic breadth-first search algorithm for robust tumor classification
On dynamic breadth-first search in external-memory
Orthopedic disease classification based on breadth-first search algorithm
Finding all minimal CURB sets
Finding purifications with minimal entanglement
On finding minimal absent words
Efficient Breadth-First Search on Massively Parallel and Distributed-Memory Machines
Finding Direction in the Search for Selection
Partial Order Reduction for Deep Bug Finding in Synchronous Hardware
The Search for Minimal Search: A Graph-Theoretic Approach
Patent Breadth in an International Setting
Finding qualitative research: an evaluation of search strategies
Finding minimum gene subsets with heuristic breadth-first search algorithm for robust tumor classification
On dynamic breadth-first search in external-memory
Orthopedic disease classification based on breadth-first search algorithm
Finding all minimal CURB sets
Finding purifications with minimal entanglement
On finding minimal absent words
Efficient Breadth-First Search on Massively Parallel and Distributed-Memory Machines
Finding Direction in the Search for Selection
Partial Order Reduction for Deep Bug Finding in Synchronous Hardware
The Search for Minimal Search: A Graph-Theoretic Approach
Patent Breadth in an International Setting