نتایج جستجو برای: dependent process instances

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

2017
Luciano García-Bañuelos Alexander Ponomarev Marlon Dumas Ingo Weber

Blockchain technology enables the execution of collaborative business processes involving untrusted parties without requiring a central authority. Speci cally, a process model comprising tasks performed by multiple parties can be coordinated via smart contracts operating on the blockchain. The consensus mechanism governing the blockchain thereby guarantees that the process model is followed by ...

Journal: :The Yale Journal of Biology and Medicine 1977
Fenton Schaffner

Adverse drug reactions in liver involve formation of a reactive metabolic intermediary of the drug, binding of the intermediary to macromolecules in the cell, notably proteins in the plasma membrane, immunological response to these altered proteins and attack against hepatocytes bearing these altered proteins by immune mechanisms. At each step in this complex process many factors act to enhance...

Journal: :Int. J. Cooperative Inf. Syst. 2016
Alfredo Cuzzocrea Francesco Folino Massimo Guarascio Luigi Pontieri

Increasing attention has been paid of late to the problem of detecting and explaining “deviant” process instances, i.e. instances diverging from normal/desired outcomes (e.g., frauds, faults, SLA violations), based on log data. Current solutions allow to discriminate between deviant and normal instances, by combining the extraction of (sequence-based) behavioral patterns with standard classifie...

2016
Arik Senderovich Andreas Rogge-Solti Avigdor Gal Jan Mendling Avishai Mandelbaum

Process mining is a rapidly developing field that aims at automated modeling of business processes based on data coming from event logs. In recent years, advances in tracking technologies, e.g., RealTime Locating Systems (RTLS), put forward the ability to log business process events as location sensor data. To apply process mining techniques to such sensor data, one needs to overcome an abstrac...

2004
Rahul Savani

The problem NASH is that of finding one Nash equilibrium of a bimatrix game. The computational complexity of this problem is a long-standing open question. The Lemke–Howson algorithm is the classical algorithm for NASH. In an earlier paper, this algorithm was shown to be exponential, even in the best case, for square bimatrix games using dual cyclic polytopes. However the games constructed ther...

Journal: :Journal of Experimental Child Psychology 2011

Journal: :Annals of Pure and Applied Logic 1984

Journal: :Multilingual Discourses 2016

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

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