Sciweavers

620 search results - page 46 / 124
» The edge-flipping group of a graph
Sort
View
AAIM
2009
Springer
101views Algorithms» more  AAIM 2009»
14 years 3 months ago
Orca Reduction and ContrAction Graph Clustering
During the last years, a wide range of huge networks has been made available to researchers. The discovery of natural groups, a task called graph clustering, in such datasets is a ...
Daniel Delling, Robert Görke, Christian Schul...
ROBOCUP
2005
Springer
109views Robotics» more  ROBOCUP 2005»
14 years 2 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
GECCO
2006
Springer
154views Optimization» more  GECCO 2006»
14 years 18 days ago
Spectral techniques for graph bisection in genetic algorithms
Various applications of spectral techniques for enhancing graph bisection in genetic algorithms are investigated. Several enhancements to a genetic algorithm for graph bisection a...
Jacob G. Martin
ESWA
2008
166views more  ESWA 2008»
13 years 8 months ago
Modular design to support green life-cycle engineering
The severe competition in the market has driven enterprises to produce a wider variety of products to meet consumers' needs. However, frequent variation of product specificat...
Hwai-En Tseng, Chien-Chen Chang, Jia-Diann Li
RSA
2008
89views more  RSA 2008»
13 years 8 months ago
Simple permutations mix even better
We study the random composition of a small family of O(n3 ) simple permutations on {0, 1}n . Specifically we ask how many randomly selected simple permutations need be composed to...
Alex Brodsky, Shlomo Hoory