2252 search results - page 398 / 451 » Lower Bounds for Dynamic Algorithms |
157
click to vote
SODA
2012
ACM
13 years 5 months ago
2012
ACM
A Nash Equilibrium is a joint strategy profile at which each agent myopically plays a best response to the other agents’ strategies, ignoring the possibility that deviating fro...
152
click to vote
KR
2004
Springer
15 years 8 months ago
2004
Springer
In this paper, partial knowledge about the possible transitions which can take place in a dynamical environment is represented by a set of pairs of propositional formulae, with th...
135
click to vote
INFOCOM
2003
IEEE
15 years 8 months ago
2003
IEEE
— It has been clear since 1988 that self-propagating code can quickly spread across a network by exploiting homogeneous security vulnerabilities. However, the last few years have...
125
Voted
SIGECOM
2010
ACM
15 years 8 months ago
2010
ACM
We study the problem of selling identical goods to n unit-demand bidders in a setting in which the total supply of goods is unknown to the mechanism. Items arrive dynamically, and...
175
click to vote
RTSS
1998
IEEE
15 years 7 months ago
1998
IEEE
The energy efficiency of systems-on-a-chip can be much improved if one were to vary the supply voltage dynamically at run time. In this paper we describe the synthesis of systems-...