Zobrazeno 1 - 2
of 2
pro vyhledávání: '"F. José A. Martínez"'
The theory of NP-completeness provides a method for telling whether a decision/optimization problem is “easy” (i.e., it belongs to the P class) or “difficult” (i.e., it belongs to the NP-complete class). Many problems related to logistics hav
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f399f68e9600480f00a71256bb9c7c55
https://doi.org/10.4018/978-1-4666-0297-7.ch007
https://doi.org/10.4018/978-1-4666-0297-7.ch007
Autor:
R. Rodolfo A. Pazos, F. José A. Martínez, P. Juan C. Rojas, B. Juan J. Gonzalez, S. René Santaolaya
Publikováno v:
Knowledge-Based and Intelligent Information and Engineering Systems ISBN: 9783642153891
KES (2)
KES (2)
A query written in natural language (NL) may involve several linguistic problems that cause a query not being interpreted or translated correctly into SQL. One of these problems is implicit information or semantic ellipsis, which can be understood as
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c2083235207dd9c31a245ea9a93a279c
https://doi.org/10.1007/978-3-642-15390-7_21
https://doi.org/10.1007/978-3-642-15390-7_21