| |
Browse All Reviews > Computing Methodologies (I) > Artificial Intelligence (I.2) > Problem Solving, Control Methods, And Search (I.2.8) > Dynamic Programming (I.2.8...)
|
|
 |
|
|
| |
|
|
| |
1-10 of 10
Reviews about "Dynamic Programming (I.2.8...)":
|
Date Reviewed |
| |
Scalable computational techniques for centrality metrics on temporally detailed social network
Gunturi V., Shekhar S., Joseph K., Carley K. Machine Learning 106(8): 1133-1169, 2017. Type: Article
To analyze social networks, where social interactions change over time, special graphs and methods are needed. In this paper, social networks are represented as temporally detailed (TD) networks; the aim is to compute centrality metric...
|
Feb 15 2018 |
| |
A deterministic fully polynomial time approximation scheme for counting integer knapsack solutions made easy
Halman N. Theoretical Computer Science 645(C): 41-47, 2016. Type: Article
The knapsack problem (KP) appears in many forms in science, economics, and engineering. The classical formulation uses a set of items, each with a weight and a value, and asks to determine the number of each item to include in a knapsa...
|
Jan 16 2017 |
| |
Consensus and synchronization in complex networks
Kocarev L., Springer Publishing Company, Incorporated, Berlin, Germany, 2013. 284 pp. Type: Book (978-3-642333-58-3)
This book contains ten papers that discuss different aspects of consensus and synchronization problems in complex networks. Even though the papers are called chapters, they are only loosely connected and do not rely on one another. The...
|
Jun 12 2013 |
| |
Approximate dynamic programming: solving the curses of dimensionality
Powell W., Wiley-Interscience, 2007. Type: Book (9780470171554)
Finally, a book devoted to dynamic programming and written using the language of operations research (OR)! This beautiful book fills a gap in the libraries of OR specialists and practitioners....
|
May 5 2008 |
| |
 Handbook of learning and approximate dynamic programming (IEEE Press Series on Computational Intelligence)
Si J., Barto A., Powell W., Wunsch D., Wiley-IEEE Press, 2004. Type: Book (9780471660545)
Dynamic programming (DP) refers to a collection of algorithms developed to solve sequential, multistage decision problems, or to determine optimal control strategies for nonlinear and stochastic dynamic systems. Until recently, DP was ...
|
Mar 18 2005 |
| |
Notes on the properties of dynamic programming used in direct load control
Aho I. Acta Cybernetica 16(3): 427-441, 2004. Type: Article
Direct load control is a method for managing consumer electricity demand during peak times, by interrupting power supply or starting generators to meet demand. Previous work on this problem used a dynamic programming solution with two ...
|
Dec 2 2004 |
| |
Visual unrolling of network evolution and the analysis of dynamic discourse
Brandes U., Corman S. Information Visualization 2(1): 40-50, 2003. Type: Article
Brandes and Corman describe a method of visualizing a series of changes in a graph (an evolving network) as a stack of layers, one for each time step. Each vertex is thus a column at a fixed point through the layers in which it persist...
|
Dec 30 2003 |
| |
Optimal Partitioning of Heterogeneous Traffic Sources in Mobile Communications Networks
Lim K., Lee Y. IEEE Transactions on Computers 46(3): 312-325, 1997. Type: Article
A mobile communications system communicates with a mobile user via a base station. In general, the tracking of the mobile user consists of two basic operations: move and find. Whenever the user moves, the move operation propagates the ...
|
Dec 1 1997 |
| |
An efficient algorithm for optimal pruning of decision trees
Almuallim H. Artificial Intelligence 83(2): 347-362, 1996. Type: Article
A method for using the techniques of dynamic programming to prune decision trees is presented. This method is particularly useful in pruning overtrained systems, and in cases where a tradeoff between accuracy and efficiency must be mad...
|
Apr 1 1997 |
| |
Optimum decision trees--an optimal variable theorem and its related applications
Miyakawa M. Acta Informatica 22(5): 475-498, 1985. Type: Article
This paper presents a method designed to improve the execution time of an algorithm which has a decision table as its input and an optimal decision tree as its output. The author describes an algorithm based on dynamic programming to ...
|
Mar 1 1987 |
| |
|
|
| |
|
|
