427 search results - page 29 / 86 » Computing the Local Consensus of Trees |
155
click to vote
BPM
2008
Springer
15 years 7 months ago
2008
Springer
Abstract. We consider workflow graphs as a model for the control flow of a business process model and study the problem of workflow graph parsing, i.e., finding the structure of a ...
169
click to vote
GECCO
2008
Springer
15 years 6 months ago
2008
Springer
We investigate a bi-variate probabilistic model-building GA for the graph bipartitioning problem. The graph bipartitioning problem is a grouping problem that requires some modifi...
134
click to vote
ICRA
2007
IEEE
15 years 11 months ago
2007
IEEE
— Randomly expanding trees are very effective in exploring high-dimensional spaces. Consequently, they are a powerful algorithmic approach to sampling-based single-query motion p...
137
click to vote
ALGORITHMICA
2006
15 years 5 months ago
2006
Abstract. In this paper we present a coarse-grained parallel algorithm, CONQUEST, for constructing boundederror summaries of high-dimensional binary attributed data in a distribute...
167
click to vote
CACM
2002
15 years 4 months ago
2002
Abstract. We have developed a digital city for Kyoto, the old capital and cultural center of Japan, as a social information infrastructure for urban everyday life including shoppin...