1554 search results - page 291 / 311 » Parameterized Complexity and Approximation Algorithms |
EMSOFT
2007
Springer
15 years 4 months ago
2007
Springer
Most recent embedded systems use caches to improve their average performance. Current timing analyses are able to compute safe timing guarantees for these systems, if tasks are ru...
SIGECOM
2006
ACM
15 years 4 months ago
2006
ACM
Finding an equilibrium of an extensive form game of imperfect information is a fundamental problem in computational game theory, but current techniques do not scale to large games...
112
click to vote
COCO
2005
Springer
15 years 3 months ago
2005
Springer
Consider a two-party quantum communication protocol for computing some function f : {0, 1}n × {0, 1}n → Z. We show that the first message of P can be compressed to O(k) classi...
ATAL
2003
Springer
15 years 3 months ago
2003
Springer
Decentralized control of a cooperative multi-agent system is the problem faced by multiple decision-makers that share a common set of objectives. The decision-makers may be robots...
SIGECOM
2010
ACM
15 years 2 months ago
2010
ACM
It is widely believed that computing payments needed to induce truthful bidding is somehow harder than simply computing the allocation. We show that the opposite is true for singl...