Sciweavers

366 search results - page 49 / 74
» Extended Star Clustering Algorithm
Sort
View
GECCO
2011
Springer
374views Optimization» more  GECCO 2011»
13 years 1 months ago
A hybrid heuristic approach for solving the generalized traveling salesman problem
The generalized traveling salesman problem (GTSP) is an NPhard problem that extends the classical traveling salesman problem by partitioning the nodes into clusters and looking fo...
Petrica C. Pop, Serban Iordache
BROADNETS
2005
IEEE
14 years 3 months ago
Performance analysis and enhancement for backbone based wireless mobile ad hoc networks
—In this paper, we present an extended Mobile Backbone Network (MBN) topology synthesis algorithm (ETSA) for constructing and maintaining a dynamic backbone structure in mobile w...
Laura Huei-jiun Ju, Izhak Rubin
BMCBI
2007
105views more  BMCBI 2007»
13 years 10 months ago
Finding regulatory elements and regulatory motifs: a general probabilistic framework
Over the last two decades a large number of algorithms has been developed for regulatory motif finding. Here we show how many of these algorithms, especially those that model bind...
Erik van Nimwegen
NN
2002
Springer
226views Neural Networks» more  NN 2002»
13 years 9 months ago
Data visualisation and manifold mapping using the ViSOM
The self-organising map (SOM) has been successfully employed as a nonparametric method for dimensionality reduction and data visualisation. However, for visualisation the SOM requ...
Hujun Yin
LCPC
2007
Springer
14 years 4 months ago
Associative Parallel Containers in STAPL
The Standard Template Adaptive Parallel Library (stapl) is a parallel programming framework that extends C++ and stl with support for parallelism. stapl provides a collection of pa...
Gabriel Tanase, Chidambareswaran Raman, Mauro Bian...