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

Protein WISDOM: A Workbench for In silico De novo Design of BioMolecules
Published on: July 25, 2013
Kazuki Takabatake1, Keisuke Yanagisawa1, Yutaka Akiyama1
1Department of Computer Science, School of Computing, Tokyo Institute of Technology, Meguro-ku 152-8550, Tokyo, Japan.
This study introduces an improved Hamiltonian design for solving polyomino puzzles, a complex combinatorial optimization problem. The new method efficiently solves larger puzzles, including 3D polycube puzzles, with high probability.
Area of Science:
Background:
Purpose of the Study:
Main Methods:
Main Results:
Conclusions: