نتایج جستجو برای: data flow graph
تعداد نتایج: 2949094 فیلتر نتایج به سال:
In the context of synthesis, scheduling assigns operations to control steps. Operations are the atomic components used for describing behavior, for example, arithmetic and Boolean operations. They are ordered partially by data dependencies (data-flow graph) and by control constructs such as conditional branches and loops (control-flow graph). A control step usually corresponds to one state, one...
We propose a new technique to analyze the control-flow, i.e., the workflow graph of a business process model, which we call symbolic execution. We consider acyclic workflow graphs that may contain inclusive OR gateways and define a symbolic execution for them that runs in quadratic time. The result allows us to decide in quadratic time, for any pair of control-flow edges or tasks of the workflo...
Concurrent trace programs (CTPs) are slices of the concurrent programs that generate the concrete program execution traces, where inter-thread event order specific to the given traces are relaxed. For such CTPs, we introduce transaction sequence graph (TSG) as a model for efficient concurrent data flow analysis. The TSG is a digraph of thread-local control nodes and edges corresponding to trans...
In [Discrete Math. 230 (2001), 133-141], it is shown that Tutte’s 3-flow conjecture that every 4-edge-connected graph has a nowhere zero 3-flow is equivalent to that every 4-edge-connected line graph has a nowhere zero 3-flow. We prove that every line graph of a 4-edgeconnected graph is Z3-connected. In particular, every line graph of a 4-edge-connected graph has a nowhere zero 3-flow.
Existing traffic flow prediction methods generally only consider the spatiotemporal characteristics of flow. However, in addition to characteristics, interference various external factors needs be considered prediction, including severe weather, major events, control, and metro failures. The current research still cannot fully use information contained these factors. To address this issue, we p...
In this paper we introduce a new kind of flow networks, called flow graphs, different to that proposed by Ford and Fulkerson. Flow graphs are meant to be used as a mathematical tool to analysis of information flow in decision algorithms, in contrast to material flow optimization considered in classical flow network analysis. In the proposed approach branches of the flow graph are interpreted as...
Recall from last time that we are looking at flow-based graph partitioning algorithm. Last time, we covered the basics of flow-based methods, and we showed how they are very different than spectral methods. This time, we will discuss flow-based graph partitioning from an embedding perspective. We will see that flow-based algorithms implicitly embed the data in a metric space, but one that is ve...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید