Skip navigation
  • 中文
  • English

DSpace CRIS

  • DSpace logo
  • Home
  • Organizations
  • Researchers
  • Research Outputs
  • Projects
  • Explore by
    • Organizations
    • Researchers
    • Research Outputs
    • Projects
  • Academic & Publications
  • Sign in
  • 中文
  • English
  1. Scholars Hub of the Academia Sinica
  2. 數理科學組
  3. 應用科學研究中心
Please use this identifier to cite or link to this item: http://ir.sinica.edu.tw/handle/201000000A/77661
Title: An Efficient Exhaustive Search for the Discretizable Distance Geometry Problem with Interval Data
Authors: Mucherino, Antonio
Lin, Jung-Hsin 
Issue Date: 2019
Relation: Proceedings of the 2019 Federated Conference on Computer Science and Information Systems 18, 135-141
URI: http://ir.sinica.edu.tw/handle/201000000A/77661
URL: http://dx.doi.org/10.15439/2019f62
Appears in Collections:應用科學研究中心

Show full item record

Page view(s)

74
checked on May 12, 2025

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

Explore by
  • Academic & Publications
  • Organizations
  • Researchers
  • Research Outputs
  • Projects
Build with DSpace-CRIS - Extension maintained and optimized by Logo 4SCIENCE Feedback