نتایج جستجو برای: access restrictions to machines

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

2005
Harald Fecher Jens Schönborn Marcel Kyas Willem P. de Roever

UML 2.0, which is the standard modeling language for objectoriented systems, has only an informally given semantics. This is in particular the case for UML 2.0 state machines, which are widely used for modeling the reactive behavior of objects. In this paper, a list of 29 newly detected trouble spots consisting of ambiguities, inconsistencies, and unnecessarily strong restrictions of UML 2.0 st...

Journal: :J. UCS 1997
Andreas Blass Yuri Gurevich

We prove the Linear Time Hierarchy Theorems for random access machines and Gurevich abstract state machines. One long-term goal of this line or research is to prove lower bounds for natural linear time problems.

Journal: :Lampung Journal of International Law 2022

This research explores how internet access restrictions lead to press freedom violations and national international law view on in the status quo. is a normative juridical study analyzed using descriptive-analytical methods, then conveyed approach make it easier conclude. These findings show that refers both positive Indonesian law, government's efforts prevent spread of fake news incitement ar...

Journal: :Health & place 2015
Ryan McNeil Hannah Cooper Will Small Thomas Kerr

Area restrictions prohibiting people from entering drug scenes or areas where they were arrested are a common socio-legal mechanism employed to regulate the spatial practices of people who use drugs (PWUD). To explore how socio-spatial patterns stemming from area restrictions shape risk, harm, and health care access, qualitative interviews and mapping exercises were conducted with 24 PWUD with ...

2017
Klaus Jansen Marten Maack Roberto Solis-Oba

We consider scheduling on identical and unrelated parallel machines with job assignment restrictions. These problems are NP-hard and they do not admit polynomial time approximation algorithms with approximation ratios smaller than 1.5 unless P=NP. However, if we impose limitations on the set of machines that can process a job, the problem sometimes becomes easier in the sense that algorithms wi...

1994
Andreas Blass Yuri Gurevich

A program Q simulates a program P in lock-step under a given representation of states of P as states of Q if there is a constant c such that if P transforms a state A to a state A in time then Q transforms (A) into (A) in time c . (Cf. the related notions of real-time computation and simulation [R,S].) The constant c is the lag factor of the simulation. We speak about time rather than the numbe...

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

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