779 search results - page 54 / 156 » Algorithms for the Sample Mean of Graphs |
141
click to vote
ICCD
2001
IEEE
16 years 1 months ago
2001
IEEE
This paper deals with low-energy code generation for a highly optimized digital signal processor designed for mobile communication applications. We present a genetic algorithm bas...
155
click to vote
TEC
2002
15 years 4 months ago
2002
Abstract--In this paper, we present an efficient graph-based evolutionary optimization technique called evolutionary graph generation (EGG) and the proposed approach is applied to ...
149
click to vote
EACL
2009
ACL Anthology
15 years 2 months ago
2009
ACL Anthology
like text summarisation requires a means of producing novel summary sentences. In order to improve the grammaticality of the generated sentence, we model a global (sentence) level...
142
click to vote
RSA
2008
15 years 3 months ago
2008
We present an expected polynomial time algorithm to generate an unlabeled connected cubic planar graph uniformly at random. We first consider rooted connected cubic planar graphs, ...
126
click to vote
AUTOMATICA
2008
15 years 4 months ago
2008
This paper presents analysis and design results for distributed consensus algorithms in multi-agent networks. We consider continuous consensus functions of the initial state of th...