1101 search results - page 146 / 221 » An Algorithm for the Graph Crossing Number Problem |
116
Voted
GECCO
2008
Springer
15 years 3 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...
122
Voted
SPAA
2005
ACM
15 years 8 months ago
2005
ACM
A weighted undirected network is ∆ growth-bounded if the number of nodes at distance 2r around any given node is at most ∆ times the number of nodes at distance r around the n...
112
Voted
DIS
2009
Springer
15 years 9 months ago
2009
Springer
Abstract. Information networks, such as social networks and that extracted from bibliographic data, are changing dynamically over time. It is crucial to discover time-evolving comm...
122
Voted
ACRI
2004
Springer
15 years 8 months ago
2004
Springer
We have investigated a problem where the goal is to find automatically the best rule for a cell in the cellular automata model. The cells are either of type OBSTACLE, EMPTY or CRE...
143
Voted
JACM
2006
15 years 2 months ago
2006
In this article, we study the problem of online market clearing where there is one commodity in the market being bought and sold by multiple buyers and sellers whose bids arrive an...