نتایج جستجو برای: consistent

تعداد نتایج: 315570  

2013
Glynn Winskel

Building on a new definition and characterization of probabilistic event structures, a general definition of distributed probabilistic strategies is proposed. Probabilistic strategies are shown to compose, with probabilistic copy-cat strategies as identities. A higher-order probabilistic process language reminiscent of Milner’s CCS is interpreted within probabilistic strategies. W.r.t. a new de...

1997
C. Pollak A. Rosa E. J. Baerends

Density functional calculations have been performed on the excited states of Cr(CO)6. In contrast to the generally accepted assignment of the spectrum by Gray and Beach1,2 but in agreement with recent CASSCF/CASPT2 calculations by Pierloot et al.3 we find the low-intensity absorption at the low-energy side of the first charge-transfer (CT) band not to be due to ligand-field (LF) excited states,...

2012
B. Sunil Kumar Sandeep Kumar

Many theorists would agree that, had it not been for the unproven unification of 802.11b and IPv7, the simulation of I/O automata might never have occurred. After years of essential research into superblocks, we demonstrate the study of consistent hashing. In this work we use flexible methodologies to argue that Boolean logic and cache coherence can collude to address this quandary. This follow...

2007
Gilles Stoltz

We propose simple randomized strategies for sequential prediction under imperfect monitoring, that is, when the forecaster does not have access to the past outcomes but rather to a feedback signal. The proposed strategies are consistent in the sense that they achieve, asymptotically, the best possible average reward. It was Rustichini [11] who first proved the existence of such consistent predi...

2010
Raj Reddy Douglas Engelbart

The expansion of multicast methods is a compelling question. After years of widespread research into hierarchical databases, we verify the synthesis of consistent hashing. In order to achieve this aim, we concentrate our efforts on validating that XML and write-back caches are always unable to get along and therefore distributed hashing is no longer considered unsafe.

2007
Gábor Lugosi Shie Mannor Gilles Stoltz

We propose simple randomized strategies for sequential prediction under imperfect monitoring, that is, when the forecaster does not have access to the past outcomes but rather to a feedback signal. The proposed strategies are consistent in the sense that they achieve, asymptotically, the best possible average reward. It was Rustichini [11] who first proved the existence of such consistent predi...

Journal: :Proceedings of the American Mathematical Society 1956

Journal: :Topology and its Applications 2014

Journal: :Canadian Medical Association Journal 2016

Journal: :Computers & Mathematics with Applications 1992

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید