Остановите войну!
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 118 matches
- 2023
- Hanhan Yan, Qiang Li, Ming-Lang Tseng, Xin Guan:
Joint-optimized feature selection and classifier hyperparameters by salp swarm algorithm in piano score difficulty measurement problem. Appl. Soft Comput. 144: 110464 (2023) - Alexsander Andrade de Melo, Celina M. H. de Figueiredo, Uéverton S. Souza:
On the computational difficulty of the terminal connection problem. RAIRO Theor. Informatics Appl. 57: 3 (2023) - Uros Males, Dusan Ramljak, Tatjana Jaksic Krüger, Tatjana Davidovic, Dragutin Ostojic, Abhay Haridas:
Controlling the Difficulty of Combinatorial Optimization Problems for Fair Proof-of-Useful-Work-Based Blockchain Consensus Protocol. Symmetry 15(1): 140 (2023) - Flynn Fromont, Hiruna Jayamanne, Paul Denny:
Exploring the Difficulty of Faded Parsons Problems for Programming Education. ACE 2023: 113-122 - Andrew David Gunter, Steven J. E. Wilton:
A Machine Learning Approach for Predicting the Difficulty of FPGA Routing Problems. FCCM 2023: 63-74 - Andrew David Gunter, Steven J. E. Wilton:
Towards a Machine Learning Approach to Predicting the Difficulty of FPGA Routing Problems. FPGA 2023: 231 - Hao Yu, Danielle A. Allessio, Will Lee, William Rebelsky, Frank Sylvia, Tom Murray, John J. Magee, Ivon Arroyo, Beverly P. Woolf, Sarah Adel Bargal, Margrit Betke:
COVES: A Cognitive-Affective Deep Model that Personalizes Math Problem Difficulty in Real Time and Improves Student Engagement with an Online Tutor. ACM Multimedia 2023: 6152-6160 - Juntae Kim, Eunjung Cho, Dongwoo Kim, Dongbin Na:
Problem-Solving Guide: Predicting the Algorithm Tags and Difficulty for Competitive Programming Problems. CoRR abs/2310.05791 (2023) - 2022
- Jia Xu, Tingting Wei, Pin Lv:
SQL-DP: A Novel Difficulty Prediction Framework for SQL Programming Problems. EDM 2022 - Ivan Bratko, Dayana Hristova, Matej Guid:
Predicting Problem Difficulty in Chess. Human-Like Machine Intelligence 2022: 487-504 - Saeed Ghadiri, Amin Nikanjam:
Novel Metric based on Walsh Coefficients for measuring problem difficulty in Estimation of Distribution Algorithms. CoRR abs/2203.13195 (2022) - 2021
- Mathys Ellis, Anna S. Bosman, Andries P. Engelbrecht:
Characterisation of environment type and difficulty for streamed data classification problems. Inf. Sci. 569: 615-649 (2021) - Dimitrios K. Karpouzos, K. L. Katsifarakis:
A new benchmark optimization problem of adaptable difficulty: theoretical considerations and practical testing. Oper. Res. 21(1): 231-250 (2021) - Arturas Skarbalius, Mantas Lukosevicius:
Automatic Programming Problem Difficulty Evaluation - First Results. ICIST 2021: 150-159 - Guadalupe Carmona-Arroyo, Jenny Betsabé Vázquez Aguirre, Marcela Quiroz-Castellanos:
One-Dimensional Bin Packing Problem: An Experimental Study of Instances Difficulty and Algorithms Performance. Fuzzy Logic Hybrid Extensions of Neural and Optimization Algorithms 2021: 171-201 - Hardik Patel, Purvi Koringa:
The impact of students behaviour, their approach, emotions and problem difficulty level on the performance prediction, evaluation and overall learning process during online coding activities. CoRR abs/2112.14407 (2021) - 2020
- Oana Vuculescu, Mads Kock Pedersen, Jacob Friis Sherson, Carsten Bergenholtz:
Human Search in a Fitness Landscape: How to Assess the Difficulty of a Search Problem. Complex. 2020: 7802169:1-7802169:11 (2020) - Zhun Fan, Wenji Li, Xinye Cai, Hui Li, Caimin Wei, Qingfu Zhang, Kalyanmoy Deb, Erik D. Goodman:
Difficulty Adjustable and Scalable Constrained Multiobjective Test Problem Toolkit. Evol. Comput. 28(3): 339-378 (2020) - Jochen Andreas Mosbacher, Clemens Brunner, Roland H. Grabner:
More Problems After Difficult Problems? Behavioral and Electrophysiological Evidence for Sequential Difficulty Effects in Mental Arithmetic. J. Numer. Cogn. 6(1): 108-128 (2020) - Pericles Philippopoulos, Alessandro Ricottone, Carlos G. Oliver:
Difficulty Scaling in Proof of Work for Decentralized Problem Solving. Ledger 5 (2020) - Xiang Li, Rabih Younes, Diana Bairaktarova, Qi Guo:
Predicting Spatial Visualization Problems' Difficulty Level from Eye-Tracking Data. Sensors 20(7): 1949 (2020) - Abdelhak Imoussaten, Pierre Couturier, Jacky Montmain:
Introducing the difficulty of implementing alternatives in the multiple criteria decision problems. FUZZ-IEEE 2020: 1-7 - Kei Ohnishi, Shota Ikeda, Tian-Li Yu:
A test problem with difficulty in decomposing into sub-problems for model-based genetic algorithms. GECCO Companion 2020: 221-222 - Hermann Kaindl, Ralph Hoch, Roman Popp:
Estimating Problem Instance Difficulty. ICEIS (1) 2020: 359-369 - Hermann Kaindl, Ralph Hoch, Roman Popp, Thomas Rathfux, Franz Lukasch:
An Investigation of Problem Instance Difficulty for Case-Based Reasoning and Heuristic Search. ICEIS (Revised Selected Papers) 2020: 158-183 - Elizabeth B. Dyer:
The Dynamic Nature of Teachers' Framing of the Problem of Student Mathematical Difficulty. ICLS 2020 - Mark Marsden, Kevin McGuinness, Joseph Antony, Haolin Wei, Milan D. Redzic, Jian Tang, Zhilan Hu, Alan F. Smeaton, Noel E. O'Connor:
Investigating Class-Level Difficulty Factors In Multi-Label Classification Problems. ICME 2020: 1-6 - Takashi Miyauchi, Tetsuo Yamada:
Design Problem of Hybrid Assembly Line with Humans and Robots Considering Automation Difficulty Level. IIAI-AAI 2020: 735-740 - Mark Marsden, Kevin McGuinness, Joseph Antony, Haolin Wei, Milan D. Redzic, Jian Tang, Zhilan Hu, Alan F. Smeaton, Noel E. O'Connor:
Investigating Class-level Difficulty Factors in Multi-label Classification Problems. CoRR abs/2005.00430 (2020) - 2019
- Kilian Verhetsel, Jeanne Pellerin, Jean-François Remacle:
A 44-element mesh of Schneiders' pyramid: Bounding the difficulty of hex-meshing problems. Comput. Aided Des. 116 (2019)
skipping 88 more matches
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-04-25 07:34 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