Search
for Topics
All Reviews
Browse All Reviews
>
Computing Methodologies (I)
>
Artificial Intelligence (I.2)
>
Problem Solving, Control Methods, And Search (I.2.8)
> Dynamic Programming (I.2.8...)
Options:
All Media Types
Journals
Proceedings
Div Books
Whole Books
Other
Date Reviewed
Title
Author
Publisher
Published Date
Descending
Ascending
110 of 40 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): 11331169, 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 metrics on them, b...
Feb 15 2018
The tyranny of uncertainty: a new framework to predict, remediate and monitor risk
Abu el Ata N., Schmandt R., Springer International Publishing, New York, NY, 2016. 373 pp. Type: Book (9783662491034)
What is risk? For our purposes, risk is some event or set of events that interferes with a planned process or activity. Generally, in the business world, organizations seek to mitigate risks, to balance the need for quick response to changing cond...
Feb 16 2017
A deterministic fully polynomial time approximation scheme for counting integer knapsack solutions made easy
Halman N. Theoretical Computer Science 645(C): 4147, 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 knapsack so that t...
Jan 16 2017
Consensus and synchronization in complex networks
Kocarev L., Springer Publishing Company, Incorporated, Berlin, Germany, 2013. 284 pp. Type: Book (9783642333583)
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 first four ...
Jun 12 2013
Rainfallrunoff modeling of flash floods in the absence of rainfall forecasts: the case of "Cévenol flash floods"
Toukourou M., Johannet A., Dreyfus G., Ayral P. Applied Intelligence 35(2): 178189, 2011. Type: Article
An innovative approach to the flashflood prediction problem is presented in this paper. For the authors, the additional challenge was to do it without the rainfall forecast. There is no doubt that their artificial neural network approach is const...
Mar 6 2012
To fill or not to fill: the gas station problem
Khuller S., Malekian A., Mestre J. ACM Transactions on Algorithms 7(3): 116, 2011. Type: Article
The traveling salesperson problem (TSP) is a wellknown optimization problem; many variations of it are routinely studied. Although sometimes considered to be a theoretical rather than a practical problem, variants of the TSP appear frequently in ...
Oct 10 2011
Neural preprocessing and control of reactive walking machines: towards versatile artificial perceptionaction systems (Cognitive Technologies Series)
Manoonpong P., SpringerVerlag New York, Inc., Secaucus, NJ, 2007. 188 pp. Type: Book (9783540688020)
Reactive behaviors are commonly observed in animals: socalled negative tropism (obstacle avoidance) and positive tropism (prey capture). These are emulated in abstract form in the walking machines described in this book. The author’s “...
Jul 3 2008
Approximate dynamic programming: solving the curses of dimensionality
Powell W., WileyInterscience, 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
A linear time algorithm for the minimum weighted feedback vertex set on diamonds
Carrabs F., Cerulli R., Gentili M., Parlato G. Information Processing Letters 94(1): 2935, 2005. Type: Article
A linear time solution of the weighted feedback vertex problem for diamond graphs is the main contribution of this paper. The result can be obtained from a more general result [1]. There, it is shown that the regarded problem is a linear extended ...
Jan 12 2006
An adaptive grid implementation of DNA sequence alignment
Chen C., Schmidt B. Future Generation Computer Systems 21(7): 9881003, 2005. Type: Article
Nowadays, clusters of computers interconnected by a fast network (with a bandwidth of several hundreds of megabytes per second) are a common, convenient, and relatively cheap way of running parallel applications rewritten using a message passing p...
Jan 5 2006
Display
5
10
15
25
50
100
per page
Reproduction in whole or in part without permission is prohibited. Copyright © 20002022 ThinkLoud, Inc.
Terms of Use

Privacy Policy