Sciweavers

1477 search results - page 18 / 296
» On Graph Problems in a Semi-streaming Model
Sort
View
WAW
2009
Springer
138views Algorithms» more  WAW 2009»
15 years 4 months ago
Information Theoretic Comparison of Stochastic Graph Models: Some Experiments
The Modularity-Q measure of community structure is known to falsely ascribe community structure to random graphs, at least when it is naively applied. Although Q is motivated by a ...
Kevin J. Lang
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
71
Voted
BIRD
2008
Springer
119views Bioinformatics» more  BIRD 2008»
14 years 11 months ago
Implementation of a Swap Matching Algorithm Using a Graph Theoretic Model
The swap matching problem consists if finding a pattern in a text, while allowing for transpositions in the pattern. A new approach using a graph-theoretic model was presented in [...
Pavlos Antoniou, Costas S. Iliopoulos, Inuka Jayas...
LSSC
2007
Springer
15 years 3 months ago
An Ant-Based Model for Multiple Sequence Alignment
Abstract. Multiple sequence alignment is a key process in today’s biology, and finding a relevant alignment of several sequences is much more challenging than just optimizing so...
Frédéric Guinand, Yoann Pigné
GECCO
2006
Springer
157views Optimization» more  GECCO 2006»
15 years 1 months ago
How randomized search heuristics find maximum cliques in planar graphs
Surprisingly, general search heuristics often solve combinatorial problems quite sufficiently, although they do not outperform specialized algorithms. Here, the behavior of simple...
Tobias Storch