Sciweavers

7978 search results - page 10 / 1596
» Combining shared-coin algorithms
Sort
View
ICPP
2003
IEEE
14 years 20 days ago
A Parallel Algorithm for Enumerating Combinations
In this paper we propose an efficient parallel algorithm with simple static and dynamic scheduling for generating combinations. It can use any number of processors (NP ≤ n − ...
Martha Torres, Alfredo Goldman, Junior Barrera
ICML
2003
IEEE
14 years 8 months ago
Using Linear-threshold Algorithms to Combine Multi-class Sub-experts
We present a new type of multi-class learning algorithm called a linear-max algorithm. Linearmax algorithms learn with a special type of attribute called a sub-expert. A sub-exper...
Chris Mesterharm
GECCO
2006
Springer
185views Optimization» more  GECCO 2006»
13 years 11 months ago
Robot gaits evolved by combining genetic algorithms and binary hill climbing
In this paper an evolutionary algorithm is used for evolving gaits in a walking biped robot controller. The focus is fast learning in a real-time environment. An incremental appro...
Lena Mariann Garder, Mats Erling Høvin
PPSN
2000
Springer
13 years 11 months ago
Symbiotic Combination as an Alternative to Sexual Recombination in Genetic Algorithms
Recombination in the Genetic Algorithm (GA) is supposed to enable the component characteristics from two parents to be extracted and then reassembled in different combinations
Richard A. Watson, Jordan B. Pollack
SPAA
2004
ACM
14 years 24 days ago
Improved combination of online algorithms for acceptance and rejection
Given two admission control algorithms that are cA-acceptcompetitive and cR-reject-competitive respectively, we give two ways to make an algorithm that is simultaneously O(cA)acce...
David P. Bunde, Yishay Mansour