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

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

Journal: :Oper. Res. Lett. 2003
Federico Della Croce Vincent T'Kindt

We consider the single machine dynamic total completion time scheduling problem. This problem is known to be NP-hard in the strong sense. The currently best available lower bound for the problem is known to be the optimal solution value of the corresponding preemptive problem which can be computed in O(n logn) time. We propose an improvement on this bound by exploiting the properties of the pre...

Journal: :Revista brasileira de anestesiologia 2004
Caio Márcio Barros de Oliveira Rioko Kimiko Sakata Adriana Machado Issy João Batista Santos Garcia

UNLABELLED BACKAGROUND AND OBJECTIVES: Since the finding that ketamine blocks NMDA receptors in the neurons of spinal dorsal horn, it has been used to inhibit or decrease central sensitization triggered by nociceptive stimulations. This study aimed at presenting pharmacological aspects of racemic ketamine and its levogyrous compound, as well as its usefulness for preemptive analgesia. CONTENT...

2012
Refael Hassin Yair Y. Shaki Uri Yovel

We consider a loss system with a fixed budget for servers. The system owner’s problem is choosing the price, and selecting the number and quality of the servers, in order to maximize profits, subject to a budget constraint. We solve the problem with identical and different service rates as well as with preemptive and non-preemptive policies. In addition, when the policy is preemptive we prove t...

2013
Evripidis Bampis Alexander V. Kononov Dimitrios Letsios Giorgio Lucarelli Maxim Sviridenko

We propose a unifying framework based on configuration linear programs and randomized rounding, for different energy optimization problems in the dynamic speed-scaling setting. We apply our framework to various scheduling and routing problems in heterogeneous computing and networking environments. We first consider the energy minimization problem of scheduling a set of jobs on a set of parallel...

Journal: :Middle East journal of anaesthesiology 2011
Antigona S Hasani Marija Soljakova Muharrem H Jakupi Serpil Z Ustalar-Ozgen

BACKGROUND Preemptive analgesia is an antinociceptive treatment that prevents central sensitization. Antinociceptive effects of diclofenac are well-known. The aim of this study was to investigate preemptive analgesic effects of intraperitoneally administrated diclofenac, before and after acute and inflammatory induced pain in rat model. METHODS Forty eight male Sprague Dawley rats were includ...

2014
Jong Dal Jung Sang Hun Kim Byung Sik Yu Hye Ji Kim

BACKGROUND Hypoxemia during one-lung ventilation (OLV) remains a major concern. The present study compared the effect of alveolar recruitment strategy (ARS) on arterial oxygenation during OLV at varying tidal volumes (Vt) with or without positive end-expiratory pressure (PEEP). METHODS In total, 120 patients undergoing wedge resection by video assisted thoracostomy were randomized into four g...

Journal: :Hepatology 2006
Jeong Won Jang Jong Young Choi Si Hyun Bae Seung Kew Yoon U Im Chang Chang Wook Kim Se Hyun Cho Jun Yeol Han Young Sok Lee

Reactivation of hepatitis B virus (HBV) during chemotherapy is well documented. However, there are limited data on this complication in patients with hepatocellular carcinoma (HCC) undergoing transarterial chemotherapy. The aim of this study was to evaluate the efficacy of preemptive lamivudine therapy in reducing hepatitis due to HBV reactivation in patients with HCC undergoing transarterial c...

1995
Thomas M. Parks Edward A. Lee

Real-time signal processing applications can be described naturally with dataflow graphs. The systems we consider have a mix of real-time and non-real-time processing, where independent dataflow graphs represent tasks and individual dataflow actors are subtasks. Rate-monotonic scheduling is optimal for fixed-priority, preemptive scheduling of periodic tasks. Priority inheritance protocols exten...

Journal: :Discrete Applied Mathematics 2011
Philippe Baptiste Jacques Carlier Alexander V. Kononov Maurice Queyranne Sergey Sevastyanov Maxim Sviridenko

In this work we show that certain classical preemptive shop scheduling problems with integral data satisfy the following integer preemption property: there exists an optimal preemptive schedule where all interruptions and all starting and completion times occur at integral dates. We also give new upper bounds on the minimal number of interruptions for various shop scheduling problems.

2010
Nicholas Kidd Suresh Jagannathan Jan Vitek

We present a reduction from a concurrent real-time program with priority preemptive scheduling to a sequential program that has the same set of behaviors. Whereas many static analyses of concurrent programs are undecidable, our reduction enables the application of any sequential program analysis to be applied to a concurrent real-time program with priority preemptive scheduling.

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

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