270 search results - page 20 / 54 » Dynamic Complexity Theory Revisited |
NIPS
2007
15 years 1 months ago
2007
A non–linear dynamic system is called contracting if initial conditions are forgotten exponentially fast, so that all trajectories converge to a single trajectory. We use contra...
STOC
2005
ACM
16 years 1 days ago
2005
ACM
We consider the problem of approximately counting integral flows in a network. We show that there is an fpras based on volume estimation if all capacities are sufficiently large, ...
HICSS
2002
IEEE
15 years 4 months ago
2002
IEEE
In this paper the problem of developing bidding strategies for the participants of dynamic energy-multi markets is studied. Attention is given to strategic bidding of load serving...
STOC
2004
ACM
16 years 19 hour ago
2004
ACM
We prove an (lg n) cell-probe lower bound on maintaining connectivity in dynamic graphs, as well as a more general trade-off between updates and queries. Our bound holds even if t...
STOC
2010
ACM
15 years 4 months ago
2010
ACM
In this paper we investigate distributed computation in dynamic networks in which the network topology changes from round to round. We consider a worst-case model in which the com...