Sciweavers

49 search results - page 10 / 10
» Characterizing a Tunably Difficult Problem in Genetic Progra...
Sort
View
ATAL
2008
Springer
13 years 7 months ago
Solving two-person zero-sum repeated games of incomplete information
In repeated games with incomplete information, rational agents must carefully weigh the tradeoffs of advantageously exploiting their information to achieve a short-term gain versu...
Andrew Gilpin, Tuomas Sandholm
EVOW
2007
Springer
13 years 9 months ago
Scale Invariance for Evolved Interest Operators
Abstract. This work presents scale invariant region detectors that apply evolved operators to extract an interest measure. We evaluate operators using their repeatability rate, and...
Leonardo Trujillo, Gustavo Olague
TJS
2002
160views more  TJS 2002»
13 years 5 months ago
Adaptive Optimizing Compilers for the 21st Century
Historically, compilers have operated by applying a fixed set of optimizations in a predetermined order. We call such an ordered list of optimizations a compilation sequence. This...
Keith D. Cooper, Devika Subramanian, Linda Torczon
USS
2010
13 years 3 months ago
Toward Automated Detection of Logic Vulnerabilities in Web Applications
Web applications are the most common way to make services and data available on the Internet. Unfortunately, with the increase in the number and complexity of these applications, ...
Viktoria Felmetsger, Ludovico Cavedon, Christopher...