Sciweavers

4469 search results - page 179 / 894
» Dynamic Program Slicing
Sort
View
IOR
2008
109views more  IOR 2008»
13 years 8 months ago
Polynomial-Time Algorithms for Stochastic Uncapacitated Lot-Sizing Problems
In 1958, Wagner and Whitin published a seminal paper on the deterministic uncapacitated lot-sizing problem, a fundamental model that is embedded in many practical production plann...
Yongpei Guan, Andrew J. Miller
CGO
2008
IEEE
13 years 10 months ago
Pipa: pipelined profiling and analysis on multi-core systems
Dynamic instrumentation systems are gaining popularity as means of constructing customized program profiling and analysis tools. However, dynamic instrumentation based analysis to...
Qin Zhao, Ioana Cutcutache, Weng-Fai Wong
ECOOP
1987
Springer
13 years 11 months ago
Dynamic Grouping in an Object-Oriented Virtual Memory Hierarchy
Object oriented programming environments frequently suffer serious performance degradation because of a high level of paging activity when implemented using a conventional virtual...
Ifor Williams, Mario Wolczko, Trevor Hopkins
NETWORKS
2008
13 years 8 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»
13 years 7 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