نتایج جستجو برای: complex products and systems cops

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

Journal: :SIAM Journal on Discrete Mathematics 2012

Journal: :مدیریت زنجیره تأمین 0
علی عباسی رائی همت مراد قلندری عیسی نخعی کمال آبادی

traceability is an ability of system to provide status reports or records pertaining of the current situation in the past. in production systems, traceability to track the product or lot of a product and access to records in the entire production process (or part of the process) of the raw material to finished product that purchased and consumed by customer will be applied. traceability in prod...

2008
Nicolas Nisse Karol Suchan

In the cops and robber game, two players play alternately by moving their tokens along the edges of a graph. The first one plays with the cops and the second one with one robber. The cops aim at capturing the robber, while the robber tries to infinitely evade the cops. The main problem consists in minimizing the number of cops used to capture the robber in a graph. This minimum number is called...

Journal: :Comput. Geom. 2011
Laurent Alonso Edward M. Reingold

We prove that n cops can capture (that is, some cop can get less than unit distance from) a robber in a continuous square region with side length less than √ 5n and hence that bn/ √ 5c+ 1 cops can capture a robber in a square with side length n. We extend these results to three dimensions, proving that 0.34869 · · ·n2 +O(n) cops can capture a robber in a n× n× n cube and that a robber can forev...

Journal: :Discrete Applied Mathematics 1987
Peter Frankl

In [1] Aigner and Fromme and in [10] Quilliot studied the following game, called cops and robbers. There is a finite, connected, undirected graph G = (V, E), m cops and one robber. First the cops choose one vertex each as initial position. Next the robber makes his choice. Afterwards they move alternately (first the cops, then the robber) along the edges of the graph or stay. Denote by c(G) the...

2006
Amaury Daele Martin Erpicum Liliane Esnault Fabienne Pironet Hervé Platteaux Etienne Vandeput Nathalie Van de Wiele

The experience described in this paper is being developed in the framework of the PALETTE1 project by two teams of researchers involved in collecting information from some Communities of practice2 (CoPs) then in providing this information through suitable formats to their technical partners in the aim of designing an interoperable and extensible set of innovative services and specific scenarios...

2011
Geetha Ranmuthugala Frances C Cunningham Jennifer J Plumb Janet Long Andrew Georgiou Johanna I Westbrook Jeffrey Braithwaite

BACKGROUND Healthcare organisations seeking to manage knowledge and improve organisational performance are increasingly investing in communities of practice (CoPs). Such investments are being made in the absence of empirical evidence demonstrating the impact of CoPs in improving the delivery of healthcare. A realist evaluation is proposed to address this knowledge gap. Underpinned by the princi...

Journal: :JOEUC 2004
Merrill Warkentin Kimberly Davis Ernst Bekkering

The objective of information system security management is information assurance: to maintain confidentiality (privacy), integrity, and availability of information resources for authorized organizational end users. User authentication is a foundation procedure in the overall pursuit of these objectives, and password procedures have historically been the primary method of user authentication. Th...

Journal: :Random Struct. Algorithms 2010
Tomasz Luczak Pawel Pralat

In this paper, we study the vertex pursuit game of Cops and Robbers where cops try to capture a robber on the vertices of the graph. The minimum number of cops required to win on a given graph G is the cop number of G. We present asymptotic results for the game of Cops and Robber played on a random graph G(n, p) for a wide range of p = p(n). It has been shown that the cop number as a function o...

Journal: :Theor. Comput. Sci. 2010
Fedor V. Fomin Petr A. Golovach Jan Kratochvíl Nicolas Nisse Karol Suchan

The Cops and Robbers game as originally defined independently by Quilliot and by Nowakowski andWinkler in the 1980s has beenmuch studied, but very few results pertain to the algorithmic and complexity aspects of it. In this paper we prove that computing the minimumnumber of cops that are guaranteed to catch a robber on a given graph is NP-hard and that the parameterized version of the problem i...

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

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