Sciweavers

1732 search results - page 45 / 347
» New Challenges in Parallel Optimization
Sort
View
ECCC
2000
140views more  ECCC 2000»
13 years 7 months ago
Randomized Approximation Schemes for Scheduling Unrelated Parallel Machines
We consider the problem of Scheduling n Independent Jobs on m Unrelated Parallel Machines, when the number of machines m is xed. We address the standard problem of minimizing the ...
Pavlos Efraimidis, Paul G. Spirakis
ISBI
2006
IEEE
14 years 1 months ago
x-f SENSE: optimal spatio-temporal sensitivity encoding for dynamic MR imaging
For high quality MR imaging of time-varying objects such as beating heart or brain hemodynamics, we need to reduce signal acquisition time without sacrificing the spatial resolut...
Jinhee Kim, Jong Chul Ye, Jaehung Yoo
ICDCS
1998
IEEE
14 years 5 days ago
Fast, Optimized Sun RPC Using Automatic Program Specialization
Fast remote procedure call (RPC) is a major concern for distributed systems. Many studies aimed at efficient RPC consist of either new implementations of the RPC paradigm or manua...
Gilles Muller, Renaud Marlet, Eugen-Nicolae Volans...
IPPS
2002
IEEE
14 years 26 days ago
Concept-Based Component Libraries and Optimizing Compilers
This paper discusses concept lattices and some of their applications in component library development and compiler optimizations. Ongoing work on concept-based userextensible simp...
Sibylle Schupp, D. P. Gregor, B. Osman, David R. M...
IPPS
1997
IEEE
14 years 4 days ago
Work-Time Optimal K-Merge Algorithms on the PRAM
The k-merge problem, given a collection of k, (2  k  n), sorted sequences of total length n, asks to merge them into a new sorted sequence. The main contribution of this work is...
Tatsuya Hayashi, Koji Nakano, Stephan Olariu