Sciweavers

720 search results - page 112 / 144
» Broadcast scheduling: algorithms and complexity
Sort
View
CC
2006
Springer
182views System Software» more  CC 2006»
15 years 2 months ago
Selective Runtime Memory Disambiguation in a Dynamic Binary Translator
Abstract. Alias analysis, traditionally performed statically, is unsuited for a dynamic binary translator (DBT) due to incomplete control-flow information and the high complexity o...
Bolei Guo, Youfeng Wu, Cheng Wang, Matthew J. Brid...
84
Voted
IPPS
2007
IEEE
15 years 4 months ago
Optimizing Sorting with Machine Learning Algorithms
The growing complexity of modern processors has made the development of highly efficient code increasingly difficult. Manually developing highly efficient code is usually expen...
Xiaoming Li, María Jesús Garzar&aacu...
DSD
2009
IEEE
387views Hardware» more  DSD 2009»
15 years 5 months ago
Architecture and DSP Implementation of a DVB-S2 Baseband Demodulator
—This paper presents the design and implementation of a baseband demodulator for DVB-S2 satellite receivers. In order to meet the requirements of different complex and multidomai...
Panayiotis Savvopoulos, Nikolaos Papandreou, Theod...
JSSPP
1997
Springer
15 years 2 months ago
Modeling of Workload in MPPs
In this paper we have characterized the inter-arrival time and service time distributions for jobs at a large MPP supercomputing center. Our findings show that the distributions ...
Joefon Jann, Pratap Pattnaik, Hubertus Franke, Fan...
75
Voted
HEURISTICS
2007
139views more  HEURISTICS 2007»
14 years 10 months ago
A composite-neighborhood tabu search approach to the traveling tournament problem
The Traveling Tournament Problem (TTP) is a combinatorial problem that combines features from the traveling salesman problem and the tournament scheduling problem. We propose a fa...
Luca Di Gaspero, Andrea Schaerf