Sciweavers

1698 search results - page 90 / 340
» Growing Complex Games
Sort
View
ICS
2009
Tsinghua U.
15 years 10 months ago
QuakeTM: parallelizing a complex sequential application using transactional memory
“Is transactional memory useful?” is the question that cannot be answered until we provide substantial applications that can evaluate its capabilities. While existing TM appli...
Vladimir Gajinov, Ferad Zyulkyarov, Osman S. Unsal...
ACMICEC
2003
ACM
172views ECommerce» more  ACMICEC 2003»
15 years 9 months ago
Automated mechanism design: complexity results stemming from the single-agent setting
The aggregation of conflicting preferences is a central problem in multiagent systems. The key difficulty is that the agents may report their preferences insincerely. Mechanism ...
Vincent Conitzer, Tuomas Sandholm
MSE
2005
IEEE
137views Hardware» more  MSE 2005»
15 years 9 months ago
Teaching SoC Design in a Project-Oriented Course Based on Robotics
The fast growing complexity and short time-tomarket of embedded systems designs, besides the great increase in capacity of today’s chips, are mobilizing the industry towards to ...
Abner Correa Barros, Pericles Lima, Juliana Xavier...
CSL
2009
Springer
15 years 10 months ago
Decision Problems for Nash Equilibria in Stochastic Games
We analyse the computational complexity of finding Nash equilibria in stochastic multiplayer games with ω-regular objectives.While the existence of an equilibrium whose payoff fal...
Michael Ummels, Dominik Wojtczak
NETGAMES
2006
ACM
15 years 9 months ago
A practical pricing model of inter-domain multicasting based on game theory
— A practical pricing mechanism is the foundation for the deploying of IP multicast in the inter-domain Internet. The IP multicast service model and its pricing mechanism are dis...
Jinjing Zhao, Peidong Zhu, Xicheng Lu, Feng Zhao