ملف الباحث
Marco A. Moreno-Armendáriz
ورقتان في مجموعة PaperMetrix
المنشورات
أوراق هذا المؤلف
-
The Mexican Magical Towns Traveling Salesman Problem: Preliminary Results
2017 · Research in Computing Science
The Traveling Salesman Problem (TSP) is a classical NPhard combinatorial problem that has been intensively studied through several decades. A large amount of literature is dedicated to this problem. TSP can be directly applied to …
-
Toward Universal Word Sense Disambiguation Using Deep Neural Networks
2019 · IEEE Access
Traditionally, approaches based on neural networks to solve the problem of disambiguation of the meaning of words (WSD) use a set of classifiers at the end, which results in a specialization in a single set …