نتایج جستجو برای: dynamic programming applications

تعداد نتایج: 1227353  

Journal: :Fundam. Inform. 2006
Anatoly E. Doroshenko Ruslan Shevchenko

In recent years light-weighted formal methods are of growing interest in construction and analysis of complex concurrent software system. A new rule-action based term rewriting framework, called TermWare, is proposed and its application to software system analysis are described to provide better cost effectiveness of software maintenance under varied requirements and specifications of operation...

2008
Zeqing Liu Min Liu Yong Jung Shin Min Kang Chahn Yong Jung

In this paper, the concepts of compatible mappings of type (A) and type (P ) are introduced in an induced metric space, two common fixed point theorems for two pairs of compatible mappings of type (A) and type (P ) in an induced complete metric space are established, and the ∗Corresponding author 2174 Zeqing Liu, Min Liu, Chahn Yong Jung and Shin Min Kang existence and uniqueness results of com...

2013
Scott Mitchell Hani Naguib George Coulouris Tim Kindberg

The use of multimedia in distributed systems has begun to include such complex and mission-critical domains as digital television production, 'video-ondemand' services, medical and security systems. These applications impose more stringent requirements on the support mechanisms provided by underlying networks and operating systems than most currently deployed continuous media applications. This...

Journal: :International Journal of Advanced Networking and Applications 2019

Journal: :Journal of Mathematical Analysis and Applications 1982

Journal: :Journal of Parallel and Distributed Computing 2010

Journal: :Journal of Mathematical Analysis and Applications 1963

Journal: :Systems & Control Letters 2010

Journal: :World Journal of Engineering and Technology 2016

2003
Rahul Shah Martin Farach-Colton

OF THE DISSERTATION Undiscretized Dynamic Programming and Ordinal Embeddings by Rahul Shah Dissertation Director: Martin Farach-Colton Many optimization problems which are known to be NP-hard on graphs are polynomially solvable on trees using dynamic programming. Dynamic programming typically involves recursive functions stored as tables. Each entry of the table corresponds to the optimal subpr...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید