Остановите войну!
for scientists:
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 14 matches
- 2010
- Pawel Delimata, Barbara Marszal-Paszek, Mikhail Moshkov, Piotr Paszek, Andrzej Skowron, Zbigniew Suraj:
Comparison of Some Classification Algorithms Based on Deterministic and Nondeterministic Decision Rules. Trans. Rough Sets 12: 90-105 (2010) - Salvatore Greco, Benedetto Matarazzo, Roman Slowinski:
On Topological Dominance-based Rough Set Approach. Trans. Rough Sets 12: 21-45 (2010) - Yukio-Pegio Gunji, Taichi Haruna:
A Non-boolean Lattice Derived by Double Indiscernibility. Trans. Rough Sets 12: 211-225 (2010) - Md. Aquil Khan, Mohua Banerjee:
A Study of Multiple-Source Approximation Systems. Trans. Rough Sets 12: 46-75 (2010) - Debasis Mazumdar, Soma Mitra, Sushmita Mitra:
Evolutionary-Rough Feature Selection for Face Recognition. Trans. Rough Sets 12: 117-142 (2010) - Pawel Osmialowski, Lech Polkowski:
Spatial Reasoning Based on Rough Mereology: A Notion of a Robot Formation and Path Planning Problem for Formations of Mobile Autonomous Robots. Trans. Rough Sets 12: 143-169 (2010) - Lech Polkowski, Maria Semeniuk-Polkowska:
Granular Rough Mereological Logics with Applications to Dependencies in Information and Decision Systems. Trans. Rough Sets 12: 1-20 (2010) - Sheela Ramanna:
Perceptually Near Pawlak Partitions. Trans. Rough Sets 12: 170-191 (2010) - Suman Saha, C. A. Murthy, Sankar K. Pal:
A Novel Split and Merge Technique for Hypertext Classification. Trans. Rough Sets 12: 192-210 (2010) - Lijun Sun, Duoqian Miao, Hongyun Zhang:
Gene Selection and Cancer Classification: A Rough Sets Based Approach. Trans. Rough Sets 12: 106-116 (2010) - Pawel Terlecki:
On the Relation between Jumping Emerging Patterns and Rough Set Theory with Application to Data Classification. Trans. Rough Sets 12: 236-338 (2010) - Jiucheng Xu, Lin Sun:
A New Knowledge Reduction Algorithm Based on Decision Power in Rough Set. Trans. Rough Sets 12: 76-89 (2010) - Daisuke Yamaguchi, Atsuo Murata, GuoDong Li, Masatake Nagai:
Rough Set Approximations in Formal Concept Analysis. Trans. Rough Sets 12: 226-235 (2010) - James F. Peters, Andrzej Skowron, Roman Slowinski, Pawan Lingras, Duoqian Miao, Shusaku Tsumoto:
Transactions on Rough Sets XII. Lecture Notes in Computer Science 6190, Springer 2010, ISBN 978-3-642-14466-0 [contents]
loading more results
failed to load more results, please try again later
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.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2024-05-06 21:40 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint