350 search results - page 24 / 70 » Lower and upper bounds on obtaining history independence |
115
Voted
COCOON
2008
Springer
15 years 3 months ago
2008
Springer
This paper describes a general quantum lower bounding technique for the communication complexity of a function that depends on the inputs given to two parties connected via paths,...
104
Voted
ICALP
2004
Springer
15 years 7 months ago
2004
Springer
Abstract. We introduce the notion of coordination mechanisms to improve the performance in systems with independent selfish and noncolluding agents. The quality of a coordination ...
87
Voted
ASYNC
1997
IEEE
15 years 5 months ago
1997
IEEE
Wediscuss response timeproperties of linear arrays and tree-like arrays of cells with various handshake communication behaviours. The response times of a networkare the delays bet...
114
click to vote
DAM
2008
15 years 1 months ago
2008
ct The average case analysis of algorithms usually assumes independent, identical distributions for the inputs. In [?], Kenyon introduced the random-order ratio, a new average case...
112
Voted
ECCC
2010
15 years 1 months ago
2010
Suppose a decision maker has to purchase a commodity over time with varying prices and demands. In particular, the price per unit might depend on the amount purchased and this pri...