Inteum Company
Links
seedsprint
Visible Legacy
RSS
News & Resources
Inteum Company News
Inteum Library
Subscribe
Search Results - traveling+salesman+problem
1
Results
Sort By:
Published Date
Updated Date
Title
ID
Descending
Ascending
Semi-Stochastic Boolean-Neural Hybrids for Solving Hard Problems
Reference #: 01457 The University of South Carolina is offering licensing opportunities for Semi-Stochastic Boolean-Neural Hybrids for Solving Hard Problems Background: Currently, there exist several emerging approaches for solving hard computational problems. Quantum computation offers algorithms that in principle allow finding solutions of some...
Published: 9/4/2022
|
Inventor(s):
Yuriy Pershyn
Keywords(s):
computing networks
,
factorization
,
neural networks
,
NP-complete problems
,
traveling salesman problem
Category(s):
Research Tools
,
Software and Computing