8009 search results - page 103 / 1602 » cans 2005 |
111
click to vote
FCT
2005
Springer
15 years 10 months ago
2005
Springer
A partitioning of a set of n items is a grouping of these items into k disjoint, equally sized classes. Any partition can be modeled as a graph. The items become the vertices of th...
122
click to vote
FSKD
2005
Springer
15 years 10 months ago
2005
Springer
Conventional virtual coupling is designed mainly for stabilizing the virtual environment (VE) and it thus may have poor performances. This paper proposes a novel adaptive virtual c...
118
click to vote
GCB
2005
Springer
15 years 10 months ago
2005
Springer
We present an extension of the standard partition function approach to RNA secondary structures that computes the probabilities Pu[i, j] that a sequence interval [i, j] is unpaired...
113
click to vote
GECCO
2005
Springer
15 years 10 months ago
2005
Springer
In genetic programming, there is a tendency for individuals in a population to accumulate fragments of code – often called introns – which are redundant in the fitness evaluat...
156
click to vote
GFKL
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. The problem of clustering data can be formulated as a graph partitioning problem. In this setting, spectral methods for obtaining optimal solutions have received a lot of...