Sciweavers

1717 search results - page 8 / 344
» On the analysis of the (1 1) memetic algorithm
Sort
View
INFORMATICALT
2006
89views more  INFORMATICALT 2006»
13 years 7 months ago
Investigation of Examples of E-Education Environment for Scientific Collaboration and Distance Graduate Studies, Part 1
The objective is to investigate two emerging information technologies in graduate studies and scientific cooperation. Internet is the first technology. The open source is the secon...
Jonas Mockus
QEST
2008
IEEE
14 years 1 months ago
Quasi-Birth-Death Processes, Tree-Like QBDs, Probabilistic 1-Counter Automata, and Pushdown Systems
We begin by observing that (discrete-time) QuasiBirth-Death Processes (QBDs) are equivalent, in a precise sense, to (discrete-time) probabilistic 1-Counter Automata (p1CAs), and b...
Kousha Etessami, Dominik Wojtczak, Mihalis Yannaka...
PPAM
2007
Springer
14 years 1 months ago
A Cost-Benefit-Based Adaptation Scheme for Multimeme Algorithms
Abstract. Memetic Algorithms are the most frequently used hybrid of Evolutionary Algorithms (EA) for real-world applications. This paper will deal with one of the most important ob...
Wilfried Jakob
CSSE
2008
IEEE
14 years 1 months ago
Stochastic Gradient Algorithm for Multi-input Systems Based on the Auxiliary Model
—This paper presents an auxiliary model based stochastic gradient parameter estimation algorithm for multiinput output-error systems by minimizing a quadratic cost function. The ...
Yuwu Liao, Xianfang Wang, Rui Feng Ding
SODA
1993
ACM
94views Algorithms» more  SODA 1993»
13 years 8 months ago
Analysis of a Simple Greedy Matching Algorithm on Random Cubic Graphs
We consider the performance of a simple greedy matching algorithm MINGREEDY when applied to random cubic graphs. We show that if λn is the expected number of vertices not matched...
Alan M. Frieze, A. J. Radcliffe, Stephen Suen