Sciweavers

2850 search results - page 25 / 570
» On Timed Models and Full Abstraction
Sort
View
100
Voted
GI
2009
Springer
14 years 10 months ago
Constraint-Based Task Scheduling with Sequence Dependent Setup Times, Time Windows and Breaks
Abstract: The work presented in this article generalizes the modeling of task scheduling problems with sequence dependent setup time on the basis of task scheduling on single respe...
Armin Wolf
PVM
2010
Springer
14 years 11 months ago
Toward Performance Models of MPI Implementations for Understanding Application Scaling Issues
Abstract. Designing and tuning parallel applications with MPI, particularly at large scale, requires understanding the performance implications of different choices of algorithms ...
Torsten Hoefler, William Gropp, Rajeev Thakur, Jes...
JNW
2008
75views more  JNW 2008»
15 years 18 days ago
Time Efficient Radio Broadcasting in Planar Graphs
Abstract-- We study the communication primitive of broadcasting (one-to-all communication) in known topology radio networks, i.e., where for each primitive the schedule of transmis...
Fredrik Manne, Qin Xin
VTC
2006
IEEE
15 years 6 months ago
IQ Space Frequency Time Codes for MIMO-OFDM Systems
Abstract: In this paper, we study concatenated coding for MIMOOFDM systems. The proposed concatenated system achieves full spatial and frequency diversity at much lower complexity ...
Samir Al-Ghadhban, R. Michael Buehrer, Brian D. Wo...
FM
2009
Springer
104views Formal Methods» more  FM 2009»
15 years 7 months ago
A Smooth Combination of Linear and Herbrand Equalities for Polynomial Time Must-Alias Analysis
Abstract. We present a new domain for analyzing must-equalities between address expressions. The domain is a smooth combination of Herbrand and affine equalities which enables us t...
Helmut Seidl, Vesal Vojdani, Varmo Vene