Sciweavers

5316 search results - page 125 / 1064
» Which Search Problems Are Random
Sort
View
153
Voted
EC
2006
163views ECommerce» more  EC 2006»
15 years 3 months ago
An Extension of Geiringer's Theorem for a Wide Class of Evolutionary Search Algorithms
The frequency with which various elements of the search space of a given evolutionary algorithm are sampled is affected by the family of recombination (reproduction) operators. Th...
Boris Mitavskiy, Jonathan E. Rowe
167
Voted
GECCO
2006
Springer
447views Optimization» more  GECCO 2006»
15 years 7 months ago
Candlestick stock analysis with genetic algorithms
Candlestick analysis, a form of stock market technical analysis, is well suited for use with a genetic search algorithm. This paper explores an implementation of marrying these tw...
Peter Belford
145
Voted
IMCSIT
2010
15 years 1 months ago
Enhanced Competitive Differential Evolution for Constrained Optimization
Abstract--The constrained optimization with differential evolution (DE) is addressed. A novel variant of competitive differential evolution with a hybridized search of feasibility ...
Josef Tvrdík, Radka Polakova
132
Voted
APAL
2006
94views more  APAL 2006»
15 years 3 months ago
Parameterized counting problems
Parameterized complexity has, so far, been largely con ned to consideration of computational problems as decision or search problems. However, it is becoming evident that the param...
Catherine McCartin
143
Voted
TWC
2008
112views more  TWC 2008»
15 years 3 months ago
Design and Analysis of Cross-Layer Tree Algorithms for Wireless Random Access
In this paper, we develop a random access scheme which combines the widely used binary exponential backoff (BEB) algorithm with a cross-layer tree algorithm (TA) that relies on suc...
Xin Wang, Yingqun Yu, Georgios B. Giannakis