Sciweavers

894 search results - page 118 / 179
» Game Theory with Costly Computation
Sort
View
CAV
2009
Springer
156views Hardware» more  CAV 2009»
16 years 29 days ago
Towards Performance Prediction of Compositional Models in Industrial GALS Designs
Systems and Networks on Chips (NoCs) are a prime design focus of many hardware manufacturers. In addition to functional verification, which is a difficult necessity, the chip desi...
Nicolas Coste, Holger Hermanns, Etienne Lantreibec...
EUROCRYPT
2008
Springer
15 years 8 months ago
Truly Efficient 2-Round Perfectly Secure Message Transmission Scheme
In the model of perfectly secure message transmission schemes (PSMTs), there are n channels between a sender and a receiver. An infinitely powerful adversary A may corrupt (observe...
Kaoru Kurosawa, Kazuhiro Suzuki
DIALM
2004
ACM
165views Algorithms» more  DIALM 2004»
15 years 11 months ago
LLS: a locality aware location service for mobile ad hoc networks
Coping with mobility and dynamism is one of the biggest challenges in ad hoc networks. An essential requirement for such networks is a service that can establish communication ses...
Ittai Abraham, Danny Dolev, Dahlia Malkhi
ATAL
2010
Springer
15 years 7 months ago
Modeling recursive reasoning by humans using empirically informed interactive POMDPs
Recursive reasoning of the form what do I think that you think that I think (and so on) arises often while acting rationally in multiagent settings. Several multiagent decision-ma...
Prashant Doshi, Xia Qu, Adam Goodie, Diana Young
WG
1995
Springer
15 years 9 months ago
On Interval Routing Schemes and Treewidth
Abstract. In this paper, we investigate which processor networks allow klabel Interval Routing Schemes, under the assumption that costs of edges may vary. We show that for each xed...
Hans L. Bodlaender, Richard B. Tan, Dimitrios M. T...