Sciweavers

2698 search results - page 309 / 540
» Approximation Algorithms for the Weighted Independent Set Pr...
Sort
View
CORR
2008
Springer
83views Education» more  CORR 2008»
15 years 6 months ago
Resource Allocation in Multiple Access Channels
We consider the problem of rate allocation in a Gaussian multiple-access channel, with the goal of maximizing a utility function over transmission rates. In contrast to the literat...
Ali ParandehGheibi, Atilla Eryilmaz, Asuman E. Ozd...
FOCS
2004
IEEE
15 years 10 months ago
Worst-Case to Average-Case Reductions Based on Gaussian Measures
We show that finding small solutions to random modular linear equations is at least as hard as approximating several lattice problems in the worst case within a factor almost line...
Daniele Micciancio, Oded Regev
CASES
2009
ACM
16 years 1 months ago
Optimal loop parallelization for maximizing iteration-level parallelism
This paper solves the open problem of extracting the maximal number of iterations from a loop that can be executed in parallel on chip multiprocessors. Our algorithm solves it opt...
Duo Liu, Zili Shao, Meng Wang, Minyi Guo, Jingling...
DATE
2002
IEEE
74views Hardware» more  DATE 2002»
15 years 11 months ago
Maze Routing with Buffer Insertion under Transition Time Constraints
In this paper, we address the problem of simultaneous routing and buffer insertion. Recently in [12, 22], the authors considered simultaneous maze routing and buffer insertion und...
Li-Da Huang, Minghorng Lai, D. F. Wong, Youxin Gao
NETWORKS
2007
15 years 6 months ago
Survivable IP network design with OSPF routing
Internet protocol (IP) traffic follows rules established by routing protocols. Shortest path based protocols, such as Open Shortest Path First (OSPF), direct traffic based on arc w...
Luciana S. Buriol, Mauricio G. C. Resende, Mikkel ...