Using sticker to solve the 3-dimensional matching problem in molecular supercomputers

Author： Guo Minyi   Chang Weng-Long   Cao Jiannong  

Publisher： Inderscience Publishers

ISSN： 1740-0562

Source： International Journal of High Performance Computing and Networking, Vol.1, Iss.1-2, 2005-08, pp. : 128-139

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Evaluation of two heuristic approaches to solve the ontology meta-matching problem

By Martinez-Gil Jorge  

Knowledge and Information Systems, Vol. 26, Iss. 2, 2011-02 ,pp. : 225-247

Springer Publishing Company

Access to resources Recommend Favorite

Using GRASP to Solve the Unit Commitment Problem

By Viana A.  

Annals of Operations Research, Vol. 120, Iss. 1-4, 2003-04 ,pp. : 117-132

Springer Publishing Company

Access to resources Recommend Favorite

Using DNA to solve the Bounded Post Correspondence Problem

By Kari L.   Gloor G.   Yu S.  

Theoretical Computer Science, Vol. 231, Iss. 2, 2000-01 ,pp. : 193-203

Elsevier

Access to resources Recommend Favorite

Automated Problem Determination Using Call-Stack Matching

By Brodie Mark   Ma Sheng   Rachevsky Leonid   Champlin Jon  

Journal of Network and Systems Management, Vol. 13, Iss. 2, 2005-06 ,pp. : 219-237

Springer Publishing Company

Access to resources Recommend Favorite

Using N-D method to solve multi-response problem in Taguchi

By Liao Hung-Chang  

Journal of Intelligent Manufacturing, Vol. 16, Iss. 3, 2005-06 ,pp. : 331-347

Springer Publishing Company

Access to resources Recommend Favorite