Sciweavers

3359 search results - page 181 / 672
» A Simplified Idea Algorithm
Sort
View
RECOMB
2004
Springer
16 years 4 months ago
Finding approximate tandem repeats in genomic sequences
An efficient algorithm is presented for detecting approximate tandem repeats in genomic sequences. The algorithm is based on a flexible statistical model which allows a wide range...
Ydo Wexler, Zohar Yakhini, Yechezkel Kashi, Dan Ge...
ICRA
2008
IEEE
118views Robotics» more  ICRA 2008»
15 years 10 months ago
HLS parameter estimation for multi-input multi-output systems
Abstract— In order to reduce computational burden of identification methods for multivariable systems, a hierarchical least squares (HLS) algorithm is developed. The basic idea ...
Ping Yuan, Feng Ding, Peter X. Liu
GECCO
2005
Springer
197views Optimization» more  GECCO 2005»
15 years 9 months ago
Breeding swarms: a GA/PSO hybrid
Abstract. In this paper we propose a novel hybrid (GA/PSO) algorithm, Breeding Swarm, combining the strengths of particle swarm optimization with genetic algorithms. The hybrid alg...
Matthew Settles, Terence Soule
STOC
1998
ACM
96views Algorithms» more  STOC 1998»
15 years 8 months ago
Randomized Protocols for Low Congestion Circuit Routing in Multistage Interconnection Networks
In this paper we study randomized algorithms for circuit switching on multistage networks related to the butterfly. We devise algorithms that route messages by constructing circu...
Richard Cole, Bruce M. Maggs, Friedhelm Meyer auf ...
SIGCSE
1997
ACM
112views Education» more  SIGCSE 1997»
15 years 8 months ago
Introducing fixed-point iteration early in a compiler course
When teaching a course in compiler design, it is conventional to introduce the iterative calculation of least fixed points quite late in the course, in the guise of iterative dat...
Max Hailperin