1434 search results - page 3 / 287 » Distributed Computing with Imperfect Randomness |
AAAI
2007
13 years 8 months ago
2007
In auction theory, agents are typically presumed to have perfect knowledge of their valuations. In practice, though, they may face barriers to this knowledge due to transaction co...
CSL
2006
Springer
13 years 10 months ago
2006
Springer
We study observation-based strategies for two-player turn-based games on graphs with omega-regular objectives. An observation-based strategy relies on imperfect information about t...
STOC
1994
ACM
13 years 10 months ago
1994
ACM
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...
ICS
1997
Tsinghua U.
13 years 10 months ago
1997
Tsinghua U.
Standard restructuring compiler tools are based on polyhedral algebra and cannot be used to analyze or restructure sparse matrix codes. We have recently shown that tools based on ...
TCOM
2010
13 years 4 months ago
2010
Abstract—This paper considers the problem of Gaussian symbols detection in MIMO systems in the presence of channel estimation errors. Under this framework we develop a computatio...