Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Nevin Mahmoud Darwish

dblp:03/7026 · also Nevin M. Darwish · DBLP profile ↗
← Back
8ranked-venue papers
1as first author
1since 2021 · last 2023
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 3 · 1 first-author · 1 since 2021Applied, interdisciplinary, general and emerging computing · 2Systems, architecture and hardware · 1Databases, data management, data science and information retrieval · 1Graphics, computer vision, multimedia, augmented reality and games · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
1 paper
Planning, search and constraint satisfaction · 100%
Theoretical computer science
1 paper
Algorithms and data structures · 100%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Knowledge, reasoning and agents › Planning, search and constraint satisfaction › game tree search › minimax search
alpha-beta pruning
0.011983
A Quantitative Analysis of the Alpha-Beta Pruning Algorithm · Artif. Intell. 1983
Knowledge, reasoning and agents › Planning, search and constraint satisfaction
game tree search
0.011983
A Quantitative Analysis of the Alpha-Beta Pruning Algorithm · Artif. Intell. 1983
Algorithms and data structures
analysis of algorithms
0.011983
A Quantitative Analysis of the Alpha-Beta Pruning Algorithm · Artif. Intell. 1983

Methods — techniques the papers use, named apart from their topics

quantitative analysis · 0.0
YearPublicationVenuePosition
2023 PlaceNet: A multi-scale semantic-aware model for visual loop closure detection
Hussein Osman, Nevin Mahmoud Darwish, AbdElMoniem Bayoumi
Eng. Appl. Artif. Intell.2
2020 SMT-LH: A New Satisfiability Modulo Theory-Based Technique for Solving Vehicle Routing Problem with Time Window Constraints
abstract
The vehicle routing problem (VRP) is the problem of designing a specific number of routes to serve a given number of customers while achieving minimum total travel distance and minimum number of vehicles. VRP with time window constraints (VRPTW) restricts that the service time of each customer should start within a time window. This problem and its variations are known to be NP-hard. This paper proposes a transformation of the NP-hard problem into another. The approach is based on satisfiability modulo theories (SMT) in order to take advantage of its relative CPU time competitiveness. This poses transformability challenges in order to apply SMT solving techniques on the VRPTW. In this work, SMT is successfully applied to solve the VRPTW. The solution quality proves to be competitive to other optimization techniques since the solving time is significantly decreased opening the door to solve much larger problems. In addition, it sets a proof for using SMT efficiently as a main step for solving optimization problems.
Lydia Wahid Rizkallah, Mona F. Ahmed, Nevin Mahmoud Darwish
Comput. J.3
2010 Inferring the Differential Student Model in a Probabilistic Domain Using Abduction inference in Bayesian networks
Nabila Khodeir, Nayer M. Wanas, Nevin Mahmoud Darwish, Nadia Hegazy
EDM3
2010 Solution of systems of Boolean equations via the integer domain
Ahmed H. Abdel-Gawad, Amir F. Atiya, Nevin Mahmoud Darwish
Inf. Sci.3
2009 Sketch recognition using particle swarm algorithms
abstract
Sketch recognition is defined as the process of identifying symbols that users draw using single or multiple strokes. Users draw strokes using a pen and the system immediately interprets their strokes as objects that can be easily manipulated. This paper uses Particle Swarm Optimization Algorithm (PSO) to divide the strokes the user draws into meaningful geometric primitives. These geometric primitives are grouped to formulate symbols which are further identified. The results show that using PSO improves segmentation results which guide the symbol recognition phase. This paper uses Support Vector Machines (SVM) classifier which further improves the final recognition accuracy.
Maha El Meseery, Mahmoud Fakhr El Din, Samia Mashali, Magda B. Fayek, Nevin Mahmoud Darwish
ICIP5
2007 Generating classification trees for small disjuncts using incremental gas
abstract
In this paper an Incremental GA techniques is proposed tosolve the problem of small disjuncts in classification trees. It is once applied on the disjuncts sorted in ascending orderand once in descending order with respect to their coverage. Both versions of the technique have been tested using benchmark datasets and the results are compared with thoseof other hybrid techniques.
Magda B. Fayek, Amira Samy Talaat, Nevin Mahmoud Darwish
GECCO3
1984 Distributed Search of Game Trees
Ossama Ibrahim El-Dessouki, Nevin Mahmoud Darwish
ICDCS2
1983 A Quantitative Analysis of the Alpha-Beta Pruning Algorithm
Nevin Mahmoud Darwish
Artif. Intell.1