Mostrando 1 - 20 Resultados de 52 Para Buscar '"NP-hard"', tiempo de consulta: 0.29s Limitar resultados
  1. 1
    Free versus bound entanglement, a NP-hard problem tackled by machine learning
    por Beatrix C. Hiesmayr
    Publicado 2021
    “...Abstract Entanglement detection in high dimensional systems is a NP-hard problem since...”
    Enlace del recurso
    article
    Agregar a favoritos
    Guardado en:
  2. 2
    Engineering Design under Imprecise Probabilities: Computational Complexity
    por Kreinovich,Vladik
    Publicado 2011
    Materias: “...NP-hard...”
    Enlace del recurso
    Agregar a favoritos
    Guardado en:
  3. 3
    Exact Recursive Calculation of Circulant Permanents: A Band of Different Diagonals inside a Uniform Matrix
    Materias: “...NP-hard problem...”
    Enlace del recurso
    article
    Agregar a favoritos
    Guardado en:
  4. 4
    QUBO formulations for training machine learning models
    “... approximately solve NP-hard problems, such as the quadratic unconstrained binary optimization (QUBO), faster...”
    Enlace del recurso
    article
    Agregar a favoritos
    Guardado en:
  5. 5
    Making the Most of Parallel Composition in Differential Privacy
    “... of determining the sensitivity of the queries, is NP-hard, but also that it is possible to use graph-theoretic...”
    Enlace del recurso
    article
    Agregar a favoritos
    Guardado en:
  6. 6
    Heuristic recurrent algorithms for photonic Ising machines
    “... to solve NP-Hard Ising problems in a photonics implementation....”
    Enlace del recurso
    article
    Agregar a favoritos
    Guardado en:
  7. 7
    Computing the metric dimension of Kayak Paddles graph and Cycles with chord
    por Ahmad,Ali, Bača,Martin, Sultan,Saba
    Publicado 2020
    “... of a robot moving in a graph space. Finding the metric dimension of a graph is an NP-hard problem. We...”
    Enlace del recurso
    Agregar a favoritos
    Guardado en:
  8. 8
    Robust combinatorial optimization under convex and discrete cost uncertainty
    por Christoph Buchheim, Jannis Kurtz
    Publicado 2018
    “... exact solution methods for NP-hard cases. While mostly concentrating on the classical concept of strict...”
    Enlace del recurso
    article
    Agregar a favoritos
    Guardado en:
  9. 9
    A local search algorithm: minimizing makespan of deteriorating jobs with relaxed agreeable weights
    “... is introduced. It is shown that the problem is NP-hard. The condition of relaxed agreeable weights...”
    Enlace del recurso
    article
    Agregar a favoritos
    Guardado en:
  10. 10
    Solving the Traveling Salesman Problem on the D-Wave Quantum Computer
    por Siddharth Jain
    Publicado 2021
    “...The traveling salesman problem is a well-known NP-hard problem in combinatorial optimization...”
    Enlace del recurso
    article
    Agregar a favoritos
    Guardado en:
  11. 11
    mRNA codon optimization with quantum computers.
    “...Reverse translation of polypeptide sequences to expressible mRNA constructs is a NP-hard...”
    Enlace del recurso
    article
    Agregar a favoritos
    Guardado en:
  12. 12
    mRNA codon optimization with quantum computers
    “...Reverse translation of polypeptide sequences to expressible mRNA constructs is a NP-hard...”
    Enlace del recurso
    article
    Agregar a favoritos
    Guardado en:
  13. 13
    Optimization of Network Coding Resources Based on Improved Quantum Genetic Algorithm
    por Tianyang Liu, Qiang Sun, Huachun Zhou, Qi Wei
    Publicado 2021
    “...The problem of network coding resource optimization with a known topological structure is NP-hard...”
    Enlace del recurso
    article
    Agregar a favoritos
    Guardado en:
  14. 14
    On kernels by rainbow paths in arc-coloured digraphs
    por Li Ruijuan, Cao Yanqin, Zhang Xinhong
    Publicado 2021
    “...) every vertex outside SS can reach SS by a rainbow path in DD. They showed that it is NP-hard...”
    Enlace del recurso
    article
    Agregar a favoritos
    Guardado en:
  15. 15
    Optimal model for the aircraft arrival and departure scheduling problem with fuzzy runway incursion time
    por Bo Sun, Ming Wei, Binbin Jing
    Publicado 2021
    “... this problem is NP-hard, a novel polynomial algorithm based on queuing theory is also proposed to obtain...”
    Enlace del recurso
    article
    Agregar a favoritos
    Guardado en:
  16. 16
    Metaheuristics for a Flow Shop Scheduling Problem with Urgent Jobs and Limited Waiting Times
    por BongJoo Jeong, Jun-Hee Han, Ju-Yong Lee
    Publicado 2021
    “..., because this problem is proved to be NP-hard, solving to optimality requires a significantly long...”
    Enlace del recurso
    article
    Agregar a favoritos
    Guardado en:
  17. 17
    Tide-Inspired Path Planning Algorithm for Autonomous Vehicles
    “... is an NP-hard problem and its execution time and complexity are major concerns when searching for optimal...”
    Enlace del recurso
    article
    Agregar a favoritos
    Guardado en:
  18. 18
    Double Roman reinforcement number in graphs
    por J. Amjadi, H. Sadeghi
    Publicado 2021
    “... is NP-hard even when restricted to bipartite graphs and then we investigate the properties of double...”
    Enlace del recurso
    article
    Agregar a favoritos
    Guardado en:
  19. 19
    Hierarchical clustering using the arithmetic-harmonic cut: complexity and experiments.
    “... such a cut is NP-hard and APX-hard but is fixed-parameter tractable, which indicates that although...”
    Enlace del recurso
    article
    Agregar a favoritos
    Guardado en:
  20. 20
    An SHO-based approach to timetable scheduling: a case study
    por Van Du Nguyen, Tram Nguyen
    Publicado 2021
    “... have to face every semester, is an NP-hard problem. It is the task of allocating the right timeslots...”
    Enlace del recurso
    article
    Agregar a favoritos
    Guardado en:
Herramientas de búsqueda: RSS — Enviar por Correo electrónico esta Búsqueda — Guardar Búsqueda