Sciweavers

2657 search results - page 118 / 532
» On the complexity of hierarchical problem solving
Sort
View
HICSS
2002
IEEE
90views Biometrics» more  HICSS 2002»
15 years 6 months ago
Knowledge-Based IS Implementation Support: An Application to the IS Change Agent Role Problem
The threat of abandoned or extensively overhauled IS is a major concern for both MIS specialists and businesses. This concern may stem from the mismatch between MIS specialist cha...
Meral Binbasioglu, Elaine Winston
CEC
2005
IEEE
15 years 3 months ago
Co-evolutionary modular neural networks for automatic problem decomposition
Abstract- Decomposing a complex computational problem into sub-problems, which are computationally simpler to solve individually and which can be combined to produce a solution to ...
Vineet R. Khare, Xin Yao, Bernhard Sendhoff, Yaoch...
ECCC
2006
99views more  ECCC 2006»
15 years 1 months ago
On the Subgroup Distance Problem
We investigate the computational complexity of finding an element of a permutation group H Sn with a minimal distance to a given Sn, for different metrics on Sn. We assume that...
Christoph Buchheim, Peter J. Cameron, Taoyang Wu
CEC
2007
IEEE
15 years 8 months ago
Evolving tiles for automated self-assembly design
Abstract— Self-assembly is a distributed, asynchronous mechanism that is pervasive across natural systems where hierarchical complex structures are built from the bottom-up. The ...
Germán Terrazas, Marian Gheorghe, Graham Ke...
GECCO
2006
Springer
157views Optimization» more  GECCO 2006»
15 years 5 months ago
gLINC: identifying composability using group perturbation
We present two novel perturbation-based linkage learning algorithms that extend LINC [5]; a version of LINC optimised for decomposition tasks (oLINC) and a hierarchical version of...
David Jonathan Coffin, Christopher D. Clack