Abstract
The Dynamic Predicate Stashing Copy Problem (DPSCP) is a problem about managing an information system in a network of computers. Information is stashed from a server computer to a set of client computers. Each client has specified a maximum lifetime of the information stashed on his computer. The problem is to find a minimum cost refresh policy during a finite period of time. We transform the DPSCP to the well known Steiner Problem in Graphs and we compare this approach with a known solution method.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
