Sciweavers

17967 search results - page 62 / 3594
» Functional timing optimization
Sort
View
CORR
2006
Springer
110views Education» more  CORR 2006»
13 years 8 months ago
Methods for Partitioning Data to Improve Parallel Execution Time for Sorting on Heterogeneous Clusters
The aim of the paper is to introduce general techniques in order to optimize the parallel execution time of sorting on a distributed architectures with processors of various speeds...
Christophe Cérin, Jean-Christophe Dubacq, J...
STOC
1995
ACM
145views Algorithms» more  STOC 1995»
13 years 11 months ago
Polynomial time approximation schemes for dense instances of NP-hard problems
We present a unified framework for designing polynomial time approximation schemes (PTASs) for “dense” instances of many NP-hard optimization problems, including maximum cut,...
Sanjeev Arora, David R. Karger, Marek Karpinski
ATMN
1996
13 years 9 months ago
Dynamic time sharing: a new approach for congestion management
A new approach for bandwidth allocation and congestion control is reported in this paper, which is of the Rate Controlled admission with Priority Scheduling service type. It is ca...
Adrian Popescu, Parag Pruthi
JCM
2008
81views more  JCM 2008»
13 years 8 months ago
An Iterative Algorithm for Joint Symbol Timing Recovery and Equalization of Short Bursts
In this work a joint clock recovery (CR) and equalization scheme for short burst transmissions is presented. The joint optimization performance may be pursued by means of both data...
Pietro Savazzi, Paolo Gamba, Lorenzo Favalli
ICC
2008
IEEE
130views Communications» more  ICC 2008»
14 years 2 months ago
A Polynomial-Time Approximation Algorithm for Weighted Sum-Rate Maximization in UWB Networks
— Scheduling in an ad hoc wireless network suffers from the non-convexity of the cost function, caused by the interference between communication links. In previous optimization t...
Gyouhwan Kim, Qiao Li, Rohit Negi