نتایج جستجو برای: non monotonic time dependent processing time
تعداد نتایج: 3782129 فیلتر نتایج به سال:
Improved Deadline Monotonic Scheduling With Dynamic and Intelligent Time Slice for Real-time Systems
In this paper the numerical analysis of flow and time dependent heat transfer of micro-tube conveying nanofluid in laminar flow is investigated. In this study, convection heat transfer of nanofluid and base fluid and transient analysis for time-varying heat flux for time step of 0.0001 second are elucidated. It is observed that the pumping power of nanofluid flowing and the maximum temperatur...
Answer Set Programming (ASP) is a well-known problem solving approach based on nonmonotonic reasoning. HEX-programs extend ASP with external atoms for access to arbitrary external sources, which can also introduce constants that do not appear in the program (value invention). In order to determine the relevant constants during (pre-)grounding, external atoms must in general be evaluated under u...
Nowadays, by successful application of on time production concept in other concepts like production management and storage, the need to complete the processing of jobs in their delivery time is considered a key issue in industrial environments. Unrelated parallel machines scheduling is a general mood of classic problems of parallel machines. In some of the applications of unrelated parallel mac...
There has been recent interest in applying Stackelberg games to infrastructure security, in which a defender must protect targets from attack by an adaptive adversary. In real-world security settings the adversaries are humans and are thus boundedly rational. Most existing approaches for computing defender strategies against boundedly rational adversaries try to optimize against specific behavi...
We consider instance queries mediated by an ontology expressed in the expressive DL ALCHIO with closed predicates. We observe that such queries are non-monotonic and cannot be expressed in monotonic variants of DATALOG, but a polynomial time translation into disjunctive DATALOG extended with negation as failure is feasible. If no closed predicates are present–in the case of classical instance c...
We consider the RandomWalk Pinning Model studied in [3] and [2]: this is a random walk X on Z d , whose law is modified by the exponential of β times LN (X ,Y ), the collision local time up to time N with the (quenched) trajectory Y of another d-dimensional random walk. If β exceeds a certain critical value βc , the two walks stick together for typical Y realizations (localized phase). A natura...
In this paper, we will deal with some important kinds of metric temporal reasoning problems that arise in many real-life situations. In particular, events X0, X1 . . . XN are modeled as time points, and a constraint between the execution times of two events Xi and Xj is either simple temporal (of the form Xi − Xj ∈ [a, b]), or has a connected feasible region that can be expressed using a finite...
Default logic is one of the most popular and successful formalisms for non-monotonic reasoning. In 2002, Bonatti and Olivetti introduced several sequent calculi for credulous and skeptical reasoning in propositional default logic. In this paper we examine these calculi from a proof-complexity perspective. In particular, we show that the calculus for credulous reasoning obeys almost the same bou...
We show that the input-output function computed by a network of asynchronous real-time processes is denoted by the unique xed point of a Scott continuous functional even though the network or its components may compute a discontinuous function. This extends a well-known principle of Kahn [Kahn, 1974] to an important class of parallel systems that has resisted the traditional xed point approach....
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید