Sciweavers

13041 search results - page 2456 / 2609
» Simulating space and time
Sort
View
STOC
1994
ACM
168views Algorithms» more  STOC 1994»
15 years 10 months ago
Fast algorithms for finding randomized strategies in game trees
Interactions among agents can be conveniently described by game trees. In order to analyze a game, it is important to derive optimal (or equilibrium) strategies for the di erent p...
Daphne Koller, Nimrod Megiddo, Bernhard von Stenge...
GECCO
2010
Springer
194views Optimization» more  GECCO 2010»
15 years 10 months ago
Mirrored variants of the (1, 2)-CMA-ES compared on the noisy BBOB-2010 testbed
Derandomization by means of mirrored samples has been recently introduced to enhance the performances of (1, λ) and (1 + 2) Evolution-Strategies (ESs) with the aim of designing f...
Anne Auger, Dimo Brockhoff, Nikolaus Hansen
ATAL
2007
Springer
15 years 10 months ago
A unified framework for multi-agent agreement
Multi-Agent Agreement problems (MAP) - the ability of a population of agents to search out and converge on a common state - are central issues in many multi-agent settings, from d...
Kiran Lakkaraju, Les Gasser
COMPSAC
2007
IEEE
15 years 10 months ago
Infrastructure Hardening: A Competitive Coevolutionary Methodology Inspired by Neo-Darwinian Arms Races
The world is increasingly dependent on critical infrastructures such as the electric power grid, water, gas, and oil transport systems, which are susceptible to cascading failures...
Travis C. Service, Daniel R. Tauritz, William M. S...
GECCO
2007
Springer
206views Optimization» more  GECCO 2007»
15 years 10 months ago
Using code metric histograms and genetic algorithms to perform author identification for software forensics
We have developed a technique to characterize software developers' styles using a set of source code metrics. This style fingerprint can be used to identify the likely author...
Robert Charles Lange, Spiros Mancoridis
« Prev « First page 2456 / 2609 Last » Next »