596 search results - page 50 / 120 » Complexity Analysis by Graph Rewriting |
GECCO
2008
Springer
13 years 9 months ago
2008
Springer
The aim of process mining is to identify and extract process patterns from data logs to reconstruct an overall process flowchart. As business processes become more and more comple...
COMPGEOM
2004
ACM
14 years 1 months ago
2004
ACM
We study the problem of computing the visibility graph defined by a set P of n points inside a polygon Q: two points p, q ∈ P are joined by an edge if the segment pq ⊂ Q. Ef...
COMPGEOM
2003
ACM
14 years 1 months ago
2003
ACM
Given a polygonal curve and a geometric graph, we describe an efficient algorithm to find a path in the graph which is most similar to the curve, using the well-known Fr´echet d...
METRICS
2002
IEEE
14 years 27 days ago
2002
IEEE
Maintaining software systems is getting more complex and difficult task, as the scale becomes larger. It is generally said that code clone is one of the factors that make softwar...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
This paper presents a complex systems overview of a power grid network under cascading conditions. The cascading effect has been simulated on three different networks, the IEEE 300...