Sciweavers

2323 search results - page 129 / 465
» Evolutionary Game Design
Sort
View
ATAL
2008
Springer
15 years 6 months ago
Playing games for security: an efficient exact algorithm for solving Bayesian Stackelberg games
In a class of games known as Stackelberg games, one agent (the leader) must commit to a strategy that can be observed by the other agent (the follower or adversary) before the adv...
Praveen Paruchuri, Jonathan P. Pearce, Janusz Mare...
BIBM
2008
IEEE
134views Bioinformatics» more  BIBM 2008»
15 years 10 months ago
New Approaches to Compare Phylogenetic Search Heuristics
We present new and novel insights into the behavior of two maximum parsimony heuristics for building evolutionary trees of different sizes. First, our results show that the heuris...
Seung-Jin Sul, Suzanne Matthews, Tiffani L. Willia...
GECCO
2008
Springer
147views Optimization» more  GECCO 2008»
15 years 5 months ago
On selecting the best individual in noisy environments
In evolutionary algorithms, the typical post-processing phase involves selection of the best-of-run individual, which becomes the final outcome of the evolutionary run. Trivial f...
Wojciech Jaskowski, Wojciech Kotlowski
PRL
2006
105views more  PRL 2006»
15 years 4 months ago
Parisian camera placement for vision metrology
This paper presents a novel camera network design methodology based on the Parisian evolutionary computation approach. This methodology proposes to partition the original problem ...
Enrique Dunn, Gustavo Olague, Evelyne Lutton
ICPP
2009
IEEE
15 years 10 months ago
Computing Equilibria in Bimatrix Games by Parallel Vertex Enumeration
—Equilibria computation is of great importance to many areas such as economics, control theory, and recently computer science. We focus on the computation of Nash equilibria in t...
Jonathan Widger, Daniel Grosu