Sciweavers

5757 search results - page 297 / 1152
» Dynamic Policy Programming
Sort
View
NETWORKS
2008
15 years 6 months ago
A Reach and Bound algorithm for acyclic dynamic-programming networks
Node pruning is a commonly used technique for solution acceleration in a dynamic programming network. In pruning, nodes are adaptively removed from the dynamic programming network...
Matthew D. Bailey, Robert L. Smith, Jeffrey M. Ald...
INFORMATICALT
2000
95views more  INFORMATICALT 2000»
15 years 6 months ago
Optimal Segmentation of Random Sequences
Abstract. This paper deals with maximum likelihood and least square segmentation of autoregressive random sequences with abruptly changing parameters. Conditional distribution of t...
Antanas Lipeika
EMSOFT
2008
Springer
15 years 8 months ago
Active property checking
Runtime property checking (as implemented in tools like Purify or Valgrind) checks whether a program execution satisfies a property. Active property checking extends runtime check...
Patrice Godefroid, Michael Y. Levin, David A. Moln...
EPS
1997
Springer
15 years 10 months ago
Tracking Extrema in Dynamic Environments
Typical applications of evolutionary optimization involve the off-line approximation of extrema of static multi-modal functions. Methods which use a variety of techniques to self-...
Peter J. Angeline
ATVA
2008
Springer
131views Hardware» more  ATVA 2008»
15 years 8 months ago
Dynamic Model Checking with Property Driven Pruning to Detect Race Conditions
We present a new property driven pruning algorithm in dynamic model checking to efficiently detect race conditions in multithreaded programs. The main idea is to use a lockset base...
Chao Wang, Yu Yang, Aarti Gupta, Ganesh Gopalakris...