Sciweavers

3328 search results - page 331 / 666
» Topological Quantum Computation
Sort
View
TPDS
2010
109views more  TPDS 2010»
15 years 5 months ago
Minimal Sets of Turns for Breaking Cycles in Graphs Modeling Networks
Abstract—We propose an algorithm that provides for deadlockfree and livelock-free routing, in particular in wormhole routed networks. The proposed algorithm requires nearly minim...
Lev B. Levitin, Mark G. Karpovsky, Mehmet Mustafa
SCL
2010
114views more  SCL 2010»
15 years 1 months ago
Input-state incidence matrix of Boolean control networks and its applications
The input-state incidence matrix of control Boolean network is proposed. It is shown that this matrix contains complete information of the input-state mapping. Using it, an easily...
Yin Zhao, Hongsheng Qi, Daizhan Cheng
ICASSP
2011
IEEE
14 years 10 months ago
Max-min fair rate control based on a saddle-point characterization of some perron roots
We consider a power-controlled wireless network with an established network topology in which the communication links (transmitter-receiver pairs) are subject to general constrain...
Slawomir Stanczak, Michal Kaliszan, Mario Goldenba...
ICN
2009
Springer
16 years 1 months ago
Measuring Route Diversity in the Internet from Remote Vantage Points
Recent works on modeling the Internet topology [8, 9] have highlighted how the complexity of relationships between Autonomous Systems (ASes) can not be oversimplified without sac...
Andrea Di Menna, Tiziana Refice, Luca Cittadini, G...
PVM
1997
Springer
15 years 11 months ago
Message-Passing Program Development by Ensemble
We present Ensemble, a message-passing implementation methodology, applied to PVM. Ensemble overcomes problems and complexities in developing applications in messagepassing enviro...
John Yiannis Cotronis