Sciweavers

6 search results - page 1 / 2
» Run the GAMUT: A Comprehensive Approach to Evaluating Game-T...
Sort
View
ATAL
2004
Springer
13 years 10 months ago
Run the GAMUT: A Comprehensive Approach to Evaluating Game-Theoretic Algorithms
We present GAMUT1 , a suite of game generators designed for testing game-theoretic algorithms. We explain why such a generator is necessary, offer a way of visualizing relationshi...
Eugene Nudelman, Jennifer Wortman, Yoav Shoham, Ke...
CGO
2008
IEEE
13 years 6 months ago
Comprehensive path-sensitive data-flow analysis
Data-flow analysis is an integral part of any aggressive optimizing compiler. We propose a framework for improving the precision of data-flow analysis in the presence of complex c...
Aditya V. Thakur, R. Govindarajan
TEC
2010
112views more  TEC 2010»
12 years 11 months ago
Population-Based Algorithm Portfolios for Numerical Optimization
In this paper, we consider the scenario that a population-based algorithm is applied to a numerical optimization problem and a solution needs to be presented within a given time bu...
Fei Peng, Ke Tang, Guoliang Chen, Xin Yao
TDP
2010
189views more  TDP 2010»
12 years 11 months ago
The PROBE Framework for the Personalized Cloaking of Private Locations
The widespread adoption of location-based services (LBS) raises increasing concerns for the protection of personal location information. A common strategy, referred to as obfuscati...
Maria Luisa Damiani, Elisa Bertino, Claudio Silves...
GECCO
2006
Springer
170views Optimization» more  GECCO 2006»
13 years 8 months ago
How an optimal observer can collapse the search space
Many metaheuristics have difficulty exploring their search space comprehensively. Exploration time and efficiency are highly dependent on the size and the ruggedness of the search...
Christophe Philemotte, Hugues Bersini