Sciweavers

2754 search results - page 103 / 551
» Distributed Weighted Matching
Sort
View
GECCO
2003
Springer
130views Optimization» more  GECCO 2003»
14 years 4 months ago
A New Approach to Improve Particle Swarm Optimization
Abstract. Particle swarm optimization (PSO) is a new evolutionary computation technique. Although PSO algorithm possesses many attractive properties, the methods of selecting inert...
Liping Zhang, Huanjun Yu, Shangxu Hu
IPPS
1998
IEEE
14 years 3 months ago
Randomization in Parallel Stringology
In this abstract, we provide an overview of our survey of randomized techniques for exploiting the parallelism in string matching problems. Broadly, the study of string matching fa...
S. Muthukrishnan
BMCBI
2006
141views more  BMCBI 2006»
13 years 11 months ago
Asymptotic behaviour and optimal word size for exact and approximate word matches between random sequences
Background: The number of k-words shared between two sequences is a simple and effcient alignment-free sequence comparison method. This statistic, D2, has been used for the cluste...
Sylvain Forêt, Miriam R. Kantorovitz, Conrad...
ICN
2005
Springer
14 years 4 months ago
Scheduling Algorithms for Input Queued Switches Using Local Search Technique
Input Queued switches have been very well studied in the recent past. The Maximum Weight Matching (MWM) algorithm is known to deliver 100% throughput under any admissible traffic. ...
Yanfeng Zheng, Simin He, Shutao Sun, Wen Gao
NIPS
1997
14 years 10 days ago
Relative Loss Bounds for Multidimensional Regression Problems
We study on-line generalized linear regression with multidimensional outputs, i.e., neural networks with multiple output nodes but no hidden nodes. We allow at the final layer tra...
Jyrki Kivinen, Manfred K. Warmuth