Sciweavers

2767 search results - page 166 / 554
» Universal Exponentiation Algorithm
Sort
View
GECCO
2008
Springer
145views Optimization» more  GECCO 2008»
14 years 11 months ago
Threshold selecting: best possible probability distribution for crossover selection in genetic algorithms
The paper considers the problem of selecting individuals in the current population in Genetic Algorithms for crossover to find a solution of high fitness of a given combinatoria...
Jörg Lässig, Karl Heinz Hoffmann, Mihael...
95
Voted
AI
2007
Springer
14 years 10 months ago
An algorithm for distributing coalitional value calculations among cooperating agents
The process of forming coalitions of software agents generally requires calculating a value for every possible coalition which indicates how beneficial that coalition would be if...
Talal Rahwan, Nicholas R. Jennings
98
Voted
IPL
2007
105views more  IPL 2007»
14 years 10 months ago
A new algorithm for testing if a regular language is locally threshold testable
A new algorithm is presented for testing if a regular language is locally threshold testable. The new algorithm is slower than existing algorithms, but its correctness proof is sh...
Mikolaj Bojanczyk
85
Voted
SODA
2010
ACM
235views Algorithms» more  SODA 2010»
15 years 7 months ago
Algorithmic Lower Bounds for Problems Parameterized by Clique-width
Many NP-hard problems can be solved efficiently when the input is restricted to graphs of bounded tree-width or clique-width. In particular, by the celebrated result of Courcelle,...
Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtano...
99
Voted
COLT
2006
Springer
15 years 2 months ago
Efficient Learning Algorithms Yield Circuit Lower Bounds
We describe a new approach for understanding the difficulty of designing efficient learning algorithms. We prove that the existence of an efficient learning algorithm for a circui...
Lance Fortnow, Adam R. Klivans