Sciweavers

1653 search results - page 162 / 331
» Computer science and game theory
Sort
View
FCT
2007
Springer
15 years 2 months ago
Product Rules in Semidefinite Programming
Abstract. In recent years we have witnessed the proliferation of semidefinite programming bounds in combinatorial optimization [1,5,8], quantum computing [9,2,3,6,4,16] and even in...
Rajat Mittal, Mario Szegedy
IJAC
2010
231views more  IJAC 2010»
14 years 7 months ago
Descriptive Complexity of Finite Abelian Groups
Title of dissertation: MODEL THEORY AND COMPLEXITY THEORY Walid Gomaa Doctor of Philosophy, 2007 Dissertation directed by: Professor William Gasarch Department of Computer Science...
Walid Gomaa
SIAMCOMP
2010
174views more  SIAMCOMP 2010»
14 years 8 months ago
On the Complexity of Nash Equilibria and Other Fixed Points
We reexamine what it means to compute Nash equilibria and, more generally, what it means to compute a fixed point of a given Brouwer function, and we investigate the complexity o...
Kousha Etessami, Mihalis Yannakakis
JSW
2007
126views more  JSW 2007»
14 years 10 months ago
On Remote and Virtual Experiments in eLearning
— The science of physics is based on theories and models as well as experiments: the former structure relations and simplify reality to a degree such that predictions on physical...
Sabina Jeschke, Harald Scheel, Thomas Richter, Chr...
CCS
2009
ACM
15 years 5 months ago
On non-cooperative location privacy: a game-theoretic analysis
In mobile networks, authentication is a required primitive of the majority of security protocols. However, an adversary can track the location of mobile nodes by monitoring pseudo...
Julien Freudiger, Mohammad Hossein Manshaei, Jean-...