3008 search results - page 507 / 602 » Independence in connected graphs |
176
click to vote
SAINT
2005
IEEE
15 years 12 months ago
2005
IEEE
In this paper, we propose an analytic approach of modeling a closed-loop network with multiple feedback loops using fluid-flow approximation. Specifically, we model building bl...
173
click to vote
DRM
2003
Springer
15 years 11 months ago
2003
Springer
In PODC 2003, Park, Chong, Siegel and Ray [22] proposed an optimistic protocol for fair exchange, based on RSA signatures. We show that their protocol is totally breakable already...
197
click to vote
FUN
2010
Springer
15 years 11 months ago
2010
Springer
We study the complexity of the popular one player combinatorial game known as Flood-It. In this game the player is given an n×n board of tiles where each tile is allocated one of ...
156
click to vote
CMG
2003
15 years 7 months ago
2003
Having trouble making robust legacy applications talk to hot new Web applications? Trying to manage business transactions with your partners when everyone is running their proprie...
151
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
This paper analyzes opportunistic schemes for transmission scheduling from one of n homogeneous queues whose channel states fluctuate independently. Considered schemes consist of ...