Sciweavers

20294 search results - page 432 / 4059
» Algorithmic Information Theory
Sort
View
AAAI
2010
15 years 7 months ago
Algorithms for Finding Approximate Formations in Games
Many computational problems in game theory, such as finding Nash equilibria, are algorithmically hard to solve. This limitation forces analysts to limit attention to restricted su...
Patrick R. Jordan, Michael P. Wellman
CORR
2008
Springer
76views Education» more  CORR 2008»
15 years 7 months ago
An Efficient Algorithm for a Sharp Approximation of Universally Quantified Inequalities
This paper introduces a new algorithm for solving a subclass of quantified constraint satisfaction problems (QCSP) where existential quantifiers precede universally quantified ine...
Alexandre Goldsztejn, Claude Michel, Michel Rueher
FGCS
2006
82views more  FGCS 2006»
15 years 7 months ago
PGGA: A predictable and grouped genetic algorithm for job scheduling
This paper presents a predictable and grouped genetic algorithm (PGGA) for job scheduling. The novelty of the PGGA is twofold: (1) a job workload estimati...
Maozhen Li, Bin Yu, Man Qi
PAA
2010
15 years 6 months ago
A simple iterative algorithm for parsimonious binary kernel Fisher discrimination
By applying recent results in optimization theory variously known as optimization transfer or majorize/minimize algorithms, an algorithm for binary, kernel, Fisher discriminant ana...
Robert F. Harrison, Kitsuchart Pasupa
GECCO
2009
Springer
133views Optimization» more  GECCO 2009»
15 years 5 months ago
Improved analysis methods for crossover-based algorithms
We deepen the theoretical analysis of the genetic algorithm for the all-pairs shortest path problem proposed by Doerr, Happ and Klein (GECCO 2008). We show that the growth of the ...
Benjamin Doerr, Madeleine Theile