It should be said that algorithms, which solve optimization tasks with moderate efficiency, can be automatically synthesized from scratch using the QSMM framework only for a small subset of tasks. To increase efficiency, the developer has to provide a proper template for a synthesized algorithm in the form of a generic state model using a C program and/or as a fuzzily specified assembler program with a custom instruction set. The developer may also improve algorithms implemented in the QSMM framework or use them in more efficient modes, which were unforeseen by the package author; in some cases that can be done without changing and recompiling the package source code.
Besides limitations caused by imperfection of algorithms used, the package may have bugs. To facilitate quicker fixing bugs in the package and the package documentation, please report them to a mailing list for QSMM package users. See below for details about accessing the mailing list.
If you want a new feature to appear in the package, e.g. a new API function, without which it is hard or even impossible to write some kind of applications, then please submit that to a mailing list for QSMM package users too.
Package users are encouraged to ask questions, ask for technical support, which indeed may require fixing implicit bugs in the package, and inform the author of real examples of package use via the mailing list. That kind of activity will hopefully improve the package. The mailing list information page is available at
Using that page you can subscribe to the mailing list, unsubscribe from the list, view list archives, and do other actions.
Software described in this manual is provided “as is,” in the hope that it will be useful, but without any warranty. See GNU General Public License, for more details.