FRINK Linked Data Fragments server

Matches in SemOpenAlex for { <https://semopenalex.org/work/W2068035612> ?p ?o ?g. }

• W2068035612 abstract "The telephone age, now nearly over, called for (inter alia) good choices of routes for calls. The new computer age is calling for clever use of memory facilities. In each case, to discern just what 'good choices' and 'clever use' should mean, one can study dynamic programming problems for controlled Markov processes describing operating networks and memories. It turns out that these two kinds of systems and problems are similar, and that useful parallels can be drawn. The systems share these features: (i) a state space partially ordered by inclusion; (ii) limited and stochastic lifetimes of entered items (calls or data blocks); (iii) the presence of combinatorially bad states; (iv) the possibility of restructuring the state (rerouting calls or reshuffling the memory); (v) control laws that indicate where arriving items are to be put. It is not unfair to say that in as much as both the routing and allocation problems are at once combinatorial and stochastic, they have showed themselves unexpectedly resistant to most approaches except number crunching. One can quickly agree with Coffman's assessment [1] that the problems are really very hard. Such a situation nevertheless leaves at least the hope that careful examination of even small examples might usefully complement simulation with understanding by describing some principles of good allocation or routing, on which the optimal decisions found in the examples seem to be based. Some efforts in the direction appear in [2]-[4]. We have shown that in various small examples a study of the state diagram quickly suggests a natural system of preferred routes and allocations based on combinatorics: the bad states are identified and avoided as much as possible; the conjecture that these preferences are optimal for many models and criteria soon gathers overwhelming force. It is justified by a proof that a control (i.e. routing, or allocation) policy based on these preferences achieves the optimal in the dynamic programming equations for suitable models and criteria. In this way one guesses and validates an optimal policy by eye-balling, and without having to do any of the computation that usually accompanies Bellman's method of dynamic programming. From the resulting policies one can abstract some of the natural principles of routing and allocation that the policies exemplify. Three such principles, those of parsimony, segregation, and justification, are illustrated in detail in [3]. Larger systems cannot be expected to succumb to the elementary domination methods that served for the small ones, but the principles extracted are broadly applicable." @default.
• W2068035612 created "2016-06-24" @default.
• W2068035612 creator A5050994331 @default.
• W2068035612 date "1983-01-01" @default.
• W2068035612 modified "2023-10-18" @default.
• W2068035612 title "Memory allocation and routing: Some dynamic programming without computation" @default.
• W2068035612 cites W1985914682 @default.
• W2068035612 cites W2024077413 @default.
• W2068035612 cites W61872089 @default.
• W2068035612 doi "https://doi.org/10.1109/cdc.1983.269617" @default.
• W2068035612 hasPublicationYear "1983" @default.
• W2068035612 type Work @default.
• W2068035612 sameAs 2068035612 @default.
• W2068035612 citedByCount "0" @default.
• W2068035612 crossrefType "proceedings-article" @default.
• W2068035612 hasAuthorship W2068035612A5050994331 @default.
• W2068035612 hasConcept C104317684 @default.
• W2068035612 hasConcept C105795698 @default.
• W2068035612 hasConcept C106189395 @default.
• W2068035612 hasConcept C112313634 @default.
• W2068035612 hasConcept C11413529 @default.
• W2068035612 hasConcept C119857082 @default.
• W2068035612 hasConcept C126255220 @default.
• W2068035612 hasConcept C127716648 @default.
• W2068035612 hasConcept C159886148 @default.
• W2068035612 hasConcept C162324750 @default.
• W2068035612 hasConcept C17744445 @default.
• W2068035612 hasConcept C185592680 @default.
• W2068035612 hasConcept C188082640 @default.
• W2068035612 hasConcept C199539241 @default.
• W2068035612 hasConcept C21547014 @default.
• W2068035612 hasConcept C2775922551 @default.
• W2068035612 hasConcept C31258907 @default.
• W2068035612 hasConcept C33923547 @default.
• W2068035612 hasConcept C37404715 @default.
• W2068035612 hasConcept C41008148 @default.
• W2068035612 hasConcept C42475967 @default.
• W2068035612 hasConcept C45237549 @default.
• W2068035612 hasConcept C48103436 @default.
• W2068035612 hasConcept C55493867 @default.
• W2068035612 hasConcept C72434380 @default.
• W2068035612 hasConcept C74172769 @default.
• W2068035612 hasConcept C80444323 @default.
• W2068035612 hasConcept C98763669 @default.
• W2068035612 hasConceptScore W2068035612C104317684 @default.
• W2068035612 hasConceptScore W2068035612C105795698 @default.
• W2068035612 hasConceptScore W2068035612C106189395 @default.
• W2068035612 hasConceptScore W2068035612C112313634 @default.
• W2068035612 hasConceptScore W2068035612C11413529 @default.
• W2068035612 hasConceptScore W2068035612C119857082 @default.
• W2068035612 hasConceptScore W2068035612C126255220 @default.
• W2068035612 hasConceptScore W2068035612C127716648 @default.
• W2068035612 hasConceptScore W2068035612C159886148 @default.
• W2068035612 hasConceptScore W2068035612C162324750 @default.
• W2068035612 hasConceptScore W2068035612C17744445 @default.
• W2068035612 hasConceptScore W2068035612C185592680 @default.
• W2068035612 hasConceptScore W2068035612C188082640 @default.
• W2068035612 hasConceptScore W2068035612C199539241 @default.
• W2068035612 hasConceptScore W2068035612C21547014 @default.
• W2068035612 hasConceptScore W2068035612C2775922551 @default.
• W2068035612 hasConceptScore W2068035612C31258907 @default.
• W2068035612 hasConceptScore W2068035612C33923547 @default.
• W2068035612 hasConceptScore W2068035612C37404715 @default.
• W2068035612 hasConceptScore W2068035612C41008148 @default.
• W2068035612 hasConceptScore W2068035612C42475967 @default.
• W2068035612 hasConceptScore W2068035612C45237549 @default.
• W2068035612 hasConceptScore W2068035612C48103436 @default.
• W2068035612 hasConceptScore W2068035612C55493867 @default.
• W2068035612 hasConceptScore W2068035612C72434380 @default.
• W2068035612 hasConceptScore W2068035612C74172769 @default.
• W2068035612 hasConceptScore W2068035612C80444323 @default.
• W2068035612 hasConceptScore W2068035612C98763669 @default.
• W2068035612 hasLocation W20680356121 @default.
• W2068035612 hasOpenAccess W2068035612 @default.
• W2068035612 hasPrimaryLocation W20680356121 @default.
• W2068035612 hasRelatedWork W2002454365 @default.
• W2068035612 hasRelatedWork W2041621488 @default.
• W2068035612 hasRelatedWork W2068035612 @default.
• W2068035612 hasRelatedWork W2117282672 @default.
• W2068035612 hasRelatedWork W2133764300 @default.
• W2068035612 hasRelatedWork W2140282437 @default.
• W2068035612 hasRelatedWork W2156021013 @default.
• W2068035612 hasRelatedWork W2156992384 @default.
• W2068035612 hasRelatedWork W3140738360 @default.
• W2068035612 hasRelatedWork W3198596521 @default.
• W2068035612 isParatext "false" @default.
• W2068035612 isRetracted "false" @default.
• W2068035612 magId "2068035612" @default.
• W2068035612 workType "article" @default.