4451 search results - page 457 / 891 » On Random Ordering Constraints |
155
Voted
JGT
2010
15 years 5 months ago
2010
Sufficient degree conditions for the existence of properly edge-colored cycles and paths in edge-colored graphs, multigraphs and random graphs are inverstigated. In particular, we...
176
Voted
ORL
2010
15 years 5 months ago
2010
The Spanning Tree Protocol routes traffic on shortest path trees. If some edges fail, the traffic has to be rerouted consequently, setting up alternative trees. In this paper we d...
166
Voted
PE
2010
Springer
15 years 5 months ago
2010
Springer
In this paper we consider a single-server cyclic polling system. Between visits to successive queues, the server is delayed by a random switch-over time. The order in which custom...
198
click to vote
PVLDB
2010
15 years 5 months ago
2010
With the emergence of new applications, e.g., computational biology, new software engineering techniques, social networks, etc., more data is in the form of graphs. Locating occur...
172
click to vote
VTC
2010
IEEE
15 years 5 months ago
2010
IEEE
—A common simplification in the treatment of random linear channels is the wide-sense stationary and uncorrelated scattering (WSSUS) assumption. For wireless channels, this assu...