![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Journal of Symbolic Computation, Volume 61-62
Volume 61-62, February - March 2014
- Joaquim Infante Barbosa
:
Symbolic computation in applied computational mechanics. 1-2 - C. M. C. Roque:
Symbolic and numerical analysis of plates in bending using Matlab. 3-11 - Maria A. R. Loja
:
On the use of particle swarm optimization to maximize bending stiffness of functionally graded structures. 12-30 - Hugo Policarpo
, Miguel Matos Neves
, N. M. M. Maia:
On a hybrid analytical-experimental technique to assess the storage modulus of resilient materials using symbolic computation. 31-52 - Miguel Belbut Gaspar, Nelson Martins-Ferreira
:
A procedure for computing the symmetric difference of regions defined by polygonal curves. 53-65
- José Luis Galán García
, Gabriel Aguilera Venegas
, Pedro Rodríguez Cielos
:
Technology integration into mathematics education and applications. 66-69 - Alfonsa García, Francisco García, Ángel Martín del Rey, Gerardo Rodríguez
, Agustín de la Villa:
Changing assessment methods: New rules, new roles. 70-84 - Djordje Kadijevich
:
Neglected critical issues of effective CAS utilization. 85-99 - Rein Prank:
A tool for evaluating solution economy of algebraic transformations. 100-115 - Stephan V. Joubert, Michael Y. Shatalov, C. E. Coetzee:
Using Fourier series to analyse mass imperfections in vibratory gyroscopes. 116-127
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.