701 search results - page 127 / 141 » An Ant Algorithm for the Steiner Tree Problem in Graphs |
154
click to vote
IEEESCC
2009
IEEE
15 years 1 months ago
2009
IEEE
In this paper we look at combining and compressing a set of workflows, such that computation can be minimized. In this context, we look at two novel theoretical problems with appl...
128
click to vote
CIKM
2007
Springer
15 years 9 months ago
2007
Springer
XML query languages typically allow the specification of structural patterns of elements. Finding the occurrences of such patterns in an XML tree is the key operation in XML quer...
122
Voted
UAI
1996
15 years 4 months ago
1996
Many algorithms for processing probabilistic networks are dependent on the topological properties of the problem's structure. Such algorithmse.g., clustering, conditioning ar...
139
Voted
LICS
2005
IEEE
15 years 9 months ago
2005
IEEE
We provide a uniform solution to the problem of synthesizing a finite-state distributed system. An instance of the synthesis problem consists of a system architecture and a tempo...
147
Voted
ICDM
2006
IEEE
15 years 9 months ago
2006
IEEE
Due to their capability for expressing semantics and relationships among data objects, semi-structured documents have become a common way of representing domain knowledge. Compari...