نتایج جستجو برای: consistent algorithm
تعداد نتایج: 1052416 فیلتر نتایج به سال:
The continuous-time histories programme stems from the consistent histories approach to quantum theory and aims to provide a fully covariant formalism for quantum mechanics. In this paper we examine some structural points of the formalism. We demonstrate a general construction of history Hilbert spaces and identify a large class of time-averaged observables. We pay particular attention to the c...
Consistent hashing-based P2P networks, which scalability is indicated by efficiency of query and maintenance cost, take the hashing algorithm as mapping relation between the data and the identifier of every node in the network. By analyzing some main characters in structured P2P network, we introduce the Restricted Scope Lookup Service(RSLS)to divide the network into some less size structured s...
The consistent histories formulation of the quantum theory of a closed system with pure initial state defines an infinite number of incompatible consistent sets, each of which gives a possible description of the physics. We investigate the possibility of using the properties of the Schmidt decomposition to define an algorithm which selects a single, physically natural, consistent set. We explai...
pinch technology is one of the best methods for designing a multi stream heat exchanger(mshe) through a network; current pinch-based methods, however, lead to a larger and more complicateddesign problems. the major drawback of the current methods is they result in designs having more individual mshe sections than essential, correspond to the enthalpy intervals on temperature vs. enthalpy diagra...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید