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

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

2007
Shuji Morisaki Tomoko Matsumura Kimiharu Ohkura Kyohei Fushida Shinji Kawaguchi Hajimu Iida

This paper proposes a method for micro process analysis of ongoing distributed software development. Micro process analysis firstly identifies process instances by matching logs of software development tools with pre-defined micro (fine-grained) process models. Micro process metrics can be measured from identified process instances. In distributed or multisited software development environment,...

Journal: :Rairo-operations Research 2021

The purpose of this paper is to propose mathematical models represent a lot sizing and scheduling problem on multiple production lines that share scarce resources investigate the computational performance proposed models. main feature differentiates from others in literature decision which organize should be taken considering availability necessary resources. optimization criterion minimization...

Journal: :British Journal of Anaesthesia 1937

Journal: :Knowledge-Based Systems 2012

Journal: :Modeling and Analysis of Information Systems 2014

Journal: :IEEE Transactions on Knowledge and Data Engineering 2008

2008
Ioana Gheţa Michael Heizmann Jürgen Beyerer

Combined stereo and focus image series are fused for obtaining robust 3D information. The combination of depth from stereo and depth from (de)focus leads to good results also when dealing with scenes presenting periodical or weak structure. For analyzing the problem in ray optics, a signal model is presented which describes the imaging of a camera array taking into consideration a defocussed pr...

The traveling salesman problem (TSP) is the problem of finding the shortest tour through all the nodes that a salesman has to visit. The TSP is probably the most famous and extensively studied problem in the field of combinatorial optimization. Because this problem is an NP-hard problem, practical large-scale instances cannot be solved by exact algorithms within acceptable computational times. ...

The traveling salesman problem (TSP) is the problem of finding the shortest tour through all the nodes that a salesman has to visit. The TSP is probably the most famous and extensively studied problem in the field of combinatorial optimization. Because this problem is an NP-hard problem, practical large-scale instances cannot be solved by exact algorithms within acceptable computational times. ...

Journal: :Baltic International Yearbook of Cognition, Logic and Communication 2019

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

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