Sciweavers

17760 search results - page 285 / 3552
» A Generalization of the Massey-Ding Algorithm
Sort
View
ISAAC
2001
Springer
104views Algorithms» more  ISAAC 2001»
15 years 11 months ago
Algorithms for Pattern Involvement in Permutations
We consider the problem of developing algorithms for the recognition of a fixed pattern within a permutation. These methods are based upon using a carefully chosen chain or tree ...
Michael H. Albert, Robert E. L. Aldred, Mike D. At...
KES
1998
Springer
15 years 11 months ago
On the effect of multi-parents recombination in binary coded genetic algorithms
Abstract--Recombination operator plays a very important role in genetic algorithms. In this paper, we present binary coded genetic algorithms in which more than two parents are inv...
Shigeyoshi Tsutsui, Lakhmi C. Jain
SOFSEM
1997
Springer
15 years 11 months ago
Time Optimal Self-Stabilizing Algorithms
: In this paper we rst present a general lower bound on the stabilization time which holds for a number of graph theoretic problems, including leader election, spanning tree constr...
Rastislav Kralovic
FORMATS
2007
Springer
15 years 10 months ago
CSL Model Checking Algorithms for Infinite-State Structured Markov Chains
Jackson queueing networks (JQNs) are a very general class of queueing networks that find their application in a variety of settings. The state space of the continuous-time Markov c...
Anne Remke, Boudewijn R. Haverkort
FSTTCS
2006
Springer
15 years 10 months ago
Approximation Algorithms for 2-Stage Stochastic Optimization Problems
Abstract. Stochastic optimization is a leading approach to model optimization problems in which there is uncertainty in the input data, whether from measurement noise or an inabili...
Chaitanya Swamy, David B. Shmoys