Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving
Castigliano's Theorem: Problem Solving
Theorems of Pappus and Guldinus: Problem Solving
Survival Tree
Statically Indeterminate Problem Solving
Biot-Savart Law: Problem-Solving
You might also read
Articles linked to this work by shared authors, journal, and citation graph.
Updated: Aug 30, 2025

Protein WISDOM: A Workbench for In silico De novo Design of BioMolecules
Published on: July 25, 2013
Yunuo Cen1, Debasis Das1, Xuanyao Fong2
1Department of Electrical and Computer Engineering, National University of Singapore, Singapore, 117583, Singapore.
This study introduces a novel tree-based heuristic search algorithm for combinatorial optimization problems. It enhances simulated annealing (SA) and coherent Ising machines (CIM) to find better solutions faster for Ising Hamiltonian problems.
Area of Science:
Background:
Purpose of the Study:
Main Methods:
Main Results:
Conclusions: