Sciweavers

894 search results - page 48 / 179
» Game Theory with Costly Computation
Sort
View
DAC
2005
ACM
15 years 3 months ago
Multiplexer restructuring for FPGA implementation cost reduction
This paper presents a novel synthesis algorithm that reduces the area needed for implementing multiplexers on an FPGA by an average of 18%. This is achieved by reducing the number...
Paul Metzgen, Dominic Nancekievill
SAGT
2009
Springer
140views Game Theory» more  SAGT 2009»
15 years 8 months ago
Price of Stability in Survivable Network Design
We study the survivable version of the game theoretic network formation model known as the Connection Game, originally introduced in [5]. In this model, players attempt to connect ...
Elliot Anshelevich, Bugra Caskurlu
TEI
2009
ACM
103views Hardware» more  TEI 2009»
15 years 8 months ago
A tangible construction kit for exploring graph theory
Graphs are a versatile representation of many systems in computer science, the social sciences, and mathematics, but graph theory is not taught in schools. We present our work on ...
Eric Schweikardt, Nwanua Elumeze, Michael Eisenber...
BCSHCI
2007
15 years 3 months ago
Habitats: a simple way to bridge artifacts, professions, and theories in ubiquitous design
This paper briefly shows how product designers as well as information system designers may use the habitat framework as a tool to inform their understanding of the pervasive compu...
Martin Brynskov, Gunnar Kramp
RP
2009
Springer
121views Control Systems» more  RP 2009»
15 years 8 months ago
Games with Opacity Condition
We describe the class of games with opacity condition, as an adequate model for security aspects of computing systems. We study their theoretical properties, relate them to reachab...
Bastien Maubert, Sophie Pinchinat