Sciweavers

6897 search results - page 1107 / 1380
» Parallelization of Modular Algorithms
Sort
View
FOCS
2008
IEEE
16 years 26 days ago
The Power of Reordering for Online Minimum Makespan Scheduling
In the classic minimum makespan scheduling problem, we are given an input sequence of jobs with processing times. A scheduling algorithm has to assign the jobs to m parallel machi...
Matthias Englert, Deniz Özmen, Matthias Weste...
GLOBECOM
2008
IEEE
16 years 26 days ago
Low-Complexity Maximum Likelihood Detection of Orthogonal Space-Time Block Codes
Abstract— In this paper, we propose a low complexity Maximum Likelihood (ML) decoding algorithm for orthogonal spacetime block codes (OSTBCs) based on the real-valued lattice rep...
Luay Azzam, Ender Ayanoglu
ASAP
2007
IEEE
134views Hardware» more  ASAP 2007»
16 years 23 days ago
Real-time FPGA-implementation for blue-sky Detection
Currently, television sets with flat plasma and LCD screens with improved resolutions and better color quality are emerging. To fully utilize their capabilities, lower resolution...
Nhut Thanh Quach, Bahman Zafarifar, Georgi Gaydadj...
ASAP
2007
IEEE
95views Hardware» more  ASAP 2007»
16 years 23 days ago
Performance Evaluation of Probe-Send Fault-tolerant Network-on-chip Router
With increasing reliability concerns for current and next generation VLSI technologies, fault-tolerance is fast becoming an integral part of system-on-chip and multicore architect...
Sumit D. Mediratta, Jeffrey T. Draper
ICCCN
2007
IEEE
16 years 22 days ago
Utility-Based Routing in Communication Networks with Unstable Links
Abstract—Traditional Dijkstra and Bellman-Ford routing algorithms can only provide the best route to each destination based on a fixed link cost model. We propose a utility-base...
Mingming Lu, Jie Wu
« Prev « First page 1107 / 1380 Last » Next »