Sciweavers

3359 search results - page 385 / 672
» A Simplified Idea Algorithm
Sort
View
131
Voted
ICANN
2010
Springer
15 years 2 months ago
Tumble Tree - Reducing Complexity of the Growing Cells Approach
We propose a data structure that decreases complexity of unsupervised competitive learning algorithms which are based on the growing cells structures approach. The idea is based on...
Hendrik Annuth, Christian-A. Bohn
CORR
2008
Springer
153views Education» more  CORR 2008»
15 years 2 months ago
Decomposition Techniques for Subgraph Matching
In the constraint programming framework, state-of-the-art static and dynamic decomposition techniques are hard to apply to problems with complete initial constraint graphs. For suc...
Stéphane Zampelli, Martin Mann, Yves Devill...
112
Voted
EJC
2010
15 years 2 months ago
Combinatorial characterization of the Assur graphs from engineering
We introduce the idea of Assur graphs, a concept originally developed and exclusively employed in the literature of the kinematics community. The paper translates the terminology,...
Brigitte Servatius, Offer Shai, Walter Whiteley
107
Voted
EOR
2008
156views more  EOR 2008»
15 years 2 months ago
Ant colony optimization for continuous domains
In this paper we present an extension of ant colony optimization (ACO) to continuous domains. We show how ACO, which was initially developed to be a metaheuristic for combinatoria...
Krzysztof Socha, Marco Dorigo
105
Voted
IJWMC
2006
85views more  IJWMC 2006»
15 years 2 months ago
A distributed clustering method for energy-efficient data gathering in sensor networks
: Since sensor nodes operate on batteries, energy-efficient mechanisms for gathering sensor data are indispensable in prolonging the lifetime of a sensor network as long as possibl...
Junpei Kamimura, Naoki Wakamiya, Masayuki Murata