1662 search results - page 140 / 333 » The Computational Complexity of Agent Design Problems |
163
click to vote
CORR
2008
Springer
15 years 3 months ago
2008
Springer
Recent work has shown how information theory extends conventional full-rationality game theory to allow bounded rational agents. The associated mathematical framework can be used ...
125
click to vote
CAD
2000
Springer
15 years 3 months ago
2000
Springer
This paper describes our initial efforts to deploy a digital library to support computer-aided collaborative design. At present, this experimental testbed, The Engineering Design ...
129
click to vote
SASP
2008
IEEE
15 years 10 months ago
2008
IEEE
—Accelerators are special purpose processors designed to speed up compute-intensive sections of applications. Two extreme endpoints in the spectrum of possible accelerators are F...
114
click to vote
MOR
2010
15 years 2 months ago
2010
We consider the problem of locating a facility on a network, represented by a graph. A set of strategic agents have different ideal locations for the facility; the cost of an age...
130
click to vote
TCS
2010
15 years 2 months ago
2010
Iterative Compression has recently led to a number of breakthroughs in parameterized complexity. Here, we show that the technique can also be useful in the design of exact exponen...