Sciweavers

1127 search results - page 109 / 226
» Testing the Expansion of a Graph
Sort
View
CEC
2008
IEEE
15 years 4 months ago
Path optimization for multiple objectives in directed graphs using genetic algorithms
Abstract— This paper presents a genetic algorithmic approach for finding efficient paths in directed graphs when optimizing multiple objectives. Its aim is to provide solutions...
Juan Rada, Ruben Parma, Wilmer Pereira
SEMWEB
2009
Springer
15 years 2 months ago
DOGMA: A Disk-Oriented Graph Matching Algorithm for RDF Databases
RDF is an increasingly important paradigm for the representation of information on the Web. As RDF databases increase in size to approach tens of millions of triples, and as sophis...
Matthias Bröcheler, Andrea Pugliese, V. S. Su...
ICWS
2008
IEEE
14 years 11 months ago
An Efficient Syntactic Web Service Composition Algorithm Based on the Planning Graph Model
In this paper, we have studied a common Web service composition problem, the syntactic matching problem, where the output parameters of a Web service can be used as the input para...
Xianrong Zheng, Yuhong Yan
ASE
2004
127views more  ASE 2004»
14 years 9 months ago
Precise Call Graphs for C Programs with Function Pointers
Abstract. The use of pointers presents serious problems for software productivity tools for software understanding, restructuring, and testing. Pointers enable indirect memory acce...
Ana Milanova, Atanas Rountev, Barbara G. Ryder
MICCAI
2010
Springer
14 years 8 months ago
Morphology-Guided Graph Search for Untangling Objects: C. elegans Analysis
We present a novel approach for extracting cluttered objects based on their morphological properties1 . Specifically, we address the problem of untangling C. elegans clusters in h...
Tammy Riklin Raviv, Vebjorn Ljosa, Annie L. Conery...