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

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

Journal: :CoRR 2014
Xiaoqiang Ren Jiming Chen Karl Henrik Johansson Ling Shi

The problem of quickest change detection with a wireless sensor node is studied in this paper. The sensor that is deployed to monitor the environment has limited energy constraint to the classical quickest change detection problem. We consider the “censoring” strategy at the sensor side, i.e., the sensor selectively sends its observations to the decision maker. The quickest change detection pro...

2009
Daniel Delling Dorothea Wagner

Up to now, research on speed-up techniques for DIJKSTRA’s algorithm focused on single-criteria scenarios. The goal was to find the quickest route within a transportation network. However, the quickest route is often not the best one. A user might be willing to accept slightly longer travel times if the cost of the journey is less. A common approach to cope with such a situation is to find Paret...

Journal: :Wireless Personal Communications 2016
Qi Zhao Bingqian Wang Xiaochun Li

In this work, we mainly discuss two classes of quickest spectrum sensing approaches. The first is the improved single-channel detection based on cumulative sum (CUSUM) and generalized likelihood ratio, applied with primary user’s signal unknown. The other is wideband spectrum sensing based on Gobar transform and Wigner-Ville transform, implementing the transformation of the parallel sensing in ...

Journal: :IEEE Transactions on Information Theory 2009

Journal: :IEEE Transactions on Signal and Information Processing over Networks 2017

2007
PHILLIP G. BRADFORD

Given σ units of data and a digraph G = (V,E) whose edges have delays, bandwidth constraints, and are labeled by terminals from a CFG (context-free grammar) G. A path p adheres to G’s path constraints iff the concatenation of all terminals along p forms a word of the language generated by G. The all-pairs quickest CFG labeled-path distance problem is: for all pairs of vertices, find the minimum...

2009
Yi-Kuei Lin

The quickest path problem, a version of the shortest path problem, is to find a single quickest path which sends a given amount of data from the source to the sink with minimum transmission time. More specifically, the capacity of each arc in the network is assumed to be deterministic. However, in many real-life networks such as computer systems, telecommunication systems, etc., the capacity of...

Journal: :CoRR 2015
Martijn Arts Andreas Bollig Rudolf Mathar

We investigate the potential of quickest detection based on the eigenvalues of the sample covariance matrix for spectrum sensing applications. A simple phase shift keying (PSK) model with additive white Gaussian noise (AWGN), with 1 primary user (PU) and K secondary users (SUs) is considered. Under both detection hypotheses H0 (noise only) and H1 (signal + noise) the eigenvalues of the sample c...

Journal: :Biomedical Journal of Scientific and Technical Research 2022

Therapeutic monoclonal antibodies (mAbs) have become one of the quickest developing instructions medication in current years and are authorized for remedy an extensive variety indications, from most cancers to autoimmune disease.

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

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