Sciweavers

12825 search results - page 2030 / 2565
» Improved PLSOM algorithm
Sort
View
IPPS
2010
IEEE
15 years 5 months ago
Large neighborhood local search optimization on graphics processing units
Local search (LS) algorithms are among the most powerful techniques for solving computationally hard problems in combinatorial optimization. These algorithms could be viewed as &q...
Thé Van Luong, Nouredine Melab, El-Ghazali ...
ISAAC
2010
Springer
291views Algorithms» more  ISAAC 2010»
15 years 5 months ago
A Tighter Analysis of Work Stealing
Abstract. Classical list scheduling is a very popular and efficient technique for scheduling jobs in parallel platforms. However, with the increasing number of processors, the cost...
Marc Tchiboukdjian, Nicolas Gast, Denis Trystram, ...
ICCAD
1998
IEEE
112views Hardware» more  ICCAD 1998»
15 years 11 months ago
Using precomputation in architecture and logic resynthesis
Abstract Althoughtremendousadvanceshave been accomplished in logic synthesis in the past two decades, in some cases logic synthesis still cannot attain the improvements possible by...
Soha Hassoun, Carl Ebeling
IPPS
1998
IEEE
15 years 11 months ago
Design, Implementation and Evaluation of Parallel Pipelined STAP on Parallel Computers
This paper presents performance results for the design and implementation of parallel pipelined Space-Time Adaptive Processing (STAP) algorithms on parallel computers. In particul...
Alok N. Choudhary, Wei-keng Liao, Donald Weiner, P...
RTSS
1998
IEEE
15 years 11 months ago
Deadline-Modification-SCAN with Maximum-Scannable-Groups for Multimedia Real-Time Disk Scheduling
suitable disk layout and network transmission schedule to minimize allocated resources (buffer size, bandwidth, ..., etc.) with maximum resource utilization. In this paper, the rea...
Ray-I Chang, Wei Kuan Shih, Ruei-Chuan Chang
« Prev « First page 2030 / 2565 Last » Next »