نتایج جستجو برای: deterministic analysis

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

Journal: :Transactions of the Association for Computational Linguistics 2013

2013
Yu Sasaki Yang Li Hikaru Sakamoto Kazuo Sakiyama

In this paper, we propose a new technique for Square Differential Fault Analysis (DFA) against AES that can recover a secret key even with a large number of noisy fault injections, while the previous approaches of the Square DFA cannot work with noise. This makes the attack more realistic because assuming the 100% accuracy of obtaining intended fault injections is usually impossible. Our succes...

2010
N. Alzeidi

Virtual channels have been introduced to enhance the performance of wormhole-switched networks. They are formed by arranging the buffer space dedicated to a given physical channel into multiple parallel buffers that share the physical bandwidth on a demand driven time-multiplexed manner. The question to be answered is: given a fixed amount of finite buffer what is the optimal way to arrange it ...

2007
N. Alzeidi M. Ould-Khaoua L. M. Mackenzie

Virtual channels have been introduced to enhance the performance of wormhole-switched networks. They are formed by arranging the buffer space dedicated to a given physical channel into multiple parallel buffers that share the physical bandwidth in a demand driven time-multiplexed manner. There have been few attempts to study the optimal arrangement of virtual channels (i.e. given a fixed amount...

1997
Steven S. Seiden

e a lower bound which converges to ~ as m goes to infinity. Prior to this work, no randomized algorithm for m > 2 was known. A randomized algorithm for m ~ 3 is presented. It achieves competitive ratios of 1.55665, 1.65888, 1.73376, 1.78295 and 1.81681, for m = 3 , . . . , 7 respectively. These competitive ratios are less than the best deterministic lower bound for m = 3,4, 5 and less than the ...

2017
Matthias Kohler Harald Räcke

In the reordering buffer management problem a sequence of requests arrive online in a finite metric space, and have to be processed by a single server. This server is equipped with a request buffer of size k and can decide at each point in time, which request from its buffer to serve next. Servicing of a request is simply done by moving the server to the location of the request. The goal is to ...

Journal: :SIAM J. Financial Math. 2014
Peter Bank Antje Fruth

We consider a broker who has to place a large order which consumes a sizable part of average daily trading volume. The broker’s aim is thus to minimize execution costs he incurs from the adverse impact of his trades on market prices. In contrast to the previous literature (see, e.g., Obizhaeva and Wang [A. Obizhaeva and J. Wang, J. Financial Markets, 16 (2013), pp. 1–32] and Predoiu, Shaikhet, ...

2014
Pratima Sarkar Chinmoy Kar Herman Dwi Surjono Latha Parthiban Mario Muñoz-Organero Gustavo A. Ramírez Pedro Muñoz Carlos Delgado Kloos Manju Bhaskar Minu M Das Jose Manuel Marquez Juan Antonio Ortega Luis Gonzalez Francisco Velasco Marc El Alami Nicolas Casel Floriana Esposito Oriana Licchelli Giovanni Semeraro

Adaptive E-learning refers to adapt the way of presentation of educational material according to the student's needs. Understanding ability differs by student to student so the learning path should vary according to their understanding ability. Some students may understand by once some may needs more with different way. This paper represents a same topic with various approaches to the diff...

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

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