Sciweavers

487 search results - page 51 / 98
» Schedulability analysis of AADL models
Sort
View
INFOCOM
2009
IEEE
14 years 4 months ago
Link Scheduling with QoS Guarantee for Wireless Relay Networks
—The emerging wireless relay networks (WRNs) are expected to provide significant improvement on throughput and extension of coverage area for next-generation wireless systems. W...
Chi-Yao Hong, Ai-Chun Pang
ICC
2008
IEEE
126views Communications» more  ICC 2008»
14 years 4 months ago
Network Coding for Two-Way Relaying: Rate Region, Sum Rate and Opportunistic Scheduling
—Network coding for two-way relaying in a three-node network is considered. The achievable rate regions under both traditional four-slot multi-hopping (FSMH) and network coding (...
Chun-Hung Liu, Feng Xue
COR
2010
164views more  COR 2010»
13 years 10 months ago
The distributed permutation flowshop scheduling problem
This paper studies a new generalization of the regular permutation flowshop scheduling problem (PFSP) referred to as the distributed permutation flowshop scheduling problem or DPF...
B. Naderi, Rubén Ruiz
MJ
2006
89views more  MJ 2006»
13 years 10 months ago
RTDT: A static QoS manager, RT scheduling, HW/SW partitioning CAD tool
The Hardware (HW)/Software (SW) partitioning/scheduling relies on two subtasks : the cost function and the real time (RT) analysis. Besides these two subtasks, the proposed generi...
Hedi Tmar, Jean-Philippe Diguet, Abdenour Azzedine...
SPIN
2010
Springer
13 years 8 months ago
Time-Bounded Reachability in Distributed Input/Output Interactive Probabilistic Chains
Abstract. We develop an algorithm to compute timed reachability probabilities for distributed models which are both probabilistic and nondeterministic. To obtain realistic results ...
Georgel Calin, Pepijn Crouzen, Pedro R. D'Argenio,...