Sciweavers

1952 search results - page 177 / 391
» Complete partitions of graphs
Sort
View
BMCBI
2008
116views more  BMCBI 2008»
15 years 6 months ago
A novel representation of RNA secondary structure based on element-contact graphs
Background: Depending on their specific structures, noncoding RNAs (ncRNAs) play important roles in many biological processes. Interest in developing new topological indices based...
Wenjie Shu, Xiaochen Bo, Zhiqiang Zheng, Shengqi W...
FOGA
2007
15 years 8 months ago
Neighborhood Graphs and Symmetric Genetic Operators
In the case where the search space has a group structure, classical genetic operators (mutation and two-parent crossover) which respect the group action are completely characterize...
Jonathan E. Rowe, Michael D. Vose, Alden H. Wright
GECCO
2003
Springer
132views Optimization» more  GECCO 2003»
15 years 11 months ago
Circuit Bipartitioning Using Genetic Algorithm
Abstract. In this paper, we propose a hybrid genetic algorithm for partitioning a VLSI circuit graph into two disjoint graphs of minimum cut size. The algorithm includes a local op...
Jong-Pil Kim, Byung Ro Moon
ROBOCUP
2005
Springer
109views Robotics» more  ROBOCUP 2005»
15 years 12 months ago
Using the Max-Plus Algorithm for Multiagent Decision Making in Coordination Graphs
Abstract. Coordination graphs offer a tractable framework for cooperative multiagent decision making by decomposing the global payoff function into a sum of local terms. Each age...
Jelle R. Kok, Nikos A. Vlassis
TAGT
1998
Springer
243views Graph Theory» more  TAGT 1998»
15 years 10 months ago
Double-Pullback Graph Transitions: A Rule-Based Framework with Incomplete Information
Reactive systems perform their tasks through interaction with their users or with other systems (as parts of a bigger system). An essential requirement for modeling such systems is...
Hartmut Ehrig, Reiko Heckel, Mercè Llabr&ea...