Sciweavers

205 search results - page 14 / 41
» When Can Limited Randomness Be Used in Repeated Games
Sort
View
112
Voted
CORR
2011
Springer
178views Education» more  CORR 2011»
14 years 7 months ago
Robust Additively Coupled Games
We determine the robust Nash equilibrium (RNE) for a wide range of problems in communications systems and networks that are faced with uncertainty in their parameters’ values. T...
Saeedeh Parsaeefard, Ahmad R. Sharafat, Mihaela va...
94
Voted
CEC
2007
IEEE
15 years 7 months ago
A fractal representation for real optimization
— The chaos game, in which a moving point is repeatedly averaged toward randomly selected vertices of a triangle, is one method of generating the fractal called the Sierpinski tr...
Daniel A. Ashlock, Justin Schonfeld
AAAI
2008
15 years 3 months ago
Lifted Probabilistic Inference with Counting Formulas
Lifted inference algorithms exploit repeated structure in probabilistic models to answer queries efficiently. Previous work such as de Salvo Braz et al.'s first-order variabl...
Brian Milch, Luke S. Zettlemoyer, Kristian Kerstin...
CEC
2008
IEEE
15 years 7 months ago
Path optimization for multiple objectives in directed graphs using genetic algorithms
Abstract— This paper presents a genetic algorithmic approach for finding efficient paths in directed graphs when optimizing multiple objectives. Its aim is to provide solutions...
Juan Rada, Ruben Parma, Wilmer Pereira
TWC
2008
120views more  TWC 2008»
15 years 16 days ago
A cartel maintenance framework to enforce cooperation in wireless networks with selfish users
Abstract-- In distributed wireless networks without centralized control, each user is its own authority to maximize its own performance. This distributed characteristic provides th...
Zhu Han, Zhu Ji, K. J. Ray Liu