China
Africa
Explore chapters and articles related to this topic
Maintenance Logistics
Published in José Manuel Torres Farinha, Asset Maintenance Engineering Methodologies, 2018
Dynamic programming is a method that permits solving problems through solutions based on successively solving similar but smaller problems. This approach is used in algorithmic tasks in which the solution of a bigger problem is relatively easy to find if there are solutions for its subproblems. Dynamic programming is an algorithmic technique that is usually based on a recurrent formula and one or some of the starting states. A subsolution of the problem is constructed from previously found ones. Dynamic programming permits the transformation of a complex problem into a sequence of simpler problems. Its essential characteristic is the multistage nature of the optimization procedure.
D
Published in Phillip A. Laplante, Dictionary of Computer Science, Engineering, and Technology, 2017
dynamic programming an algorithmic technique in which an optimization problem is solved by caching subproblem solutions (memorization) rather than recomputing them. See also greedy algorithm, principle of optimality.
Architecture meets computation: an overview of the evolution of computational design approaches in architecture
Published in Architectural Science Review, 2020
Architecture has also embraced methods from the computer science field, especially algorithmic techniques. The design paradigm algorithmic architecture was proposed by Terzidis (2006), who believed that the use of algorithms in architectural design should be further explored due to the advantages it entailed in automating tedious tasks and exploring generative processes, among others. Similarly, Burry (2011) introduced the idea of programming as a culture and identified three scripting cultures in architecture, one for productivity, another for research, and yet another for creative exploration. Still within this perspective, we highlight the works of Woodbury (2010), Jabi (2013), and Schumacher (2009, 2012).