Sciweavers

65 search results - page 9 / 13
» On Optimal Solutions for the Bottleneck Tower of Hanoi Probl...
Sort
View
EOR
2006
87views more  EOR 2006»
13 years 7 months ago
Applying machine based decomposition in 2-machine flow shops
The Shifting Bottleneck (SB) heuristic is among the most successful approximation methods for solving the Job Shop problem. It is essentially a machine based decomposition procedu...
Saral Mukherjee, A. K. Chatterjee
INFOCOM
2006
IEEE
14 years 1 months ago
Distributed Uplink Power Control for Optimal SIR Assignment in Cellular Data Networks
Abstract—This paper solves the joint power control and SIR assignment problem through distributed algorithms in the uplink of multi-cellular wireless networks. The 1993 Foschini-...
Prashanth Hande, Sundeep Rangan, Mung Chiang
IPPS
2007
IEEE
14 years 1 months ago
Optimal Assignment of a Tree-Structured Context Reasoning Procedure onto a Host-Satellites System
In this paper, we study the problem of an optimal assignment of a tree-structured context reasoning procedure onto the computation resources in a hostsatellites configuration. The...
Hailiang Mei, Pravin Pawar, Ing Widya
DAC
2005
ACM
14 years 8 months ago
Memory access optimization through combined code scheduling, memory allocation, and array binding in embedded system design
In many of embedded systems, particularly for those with high data computations, the delay of memory access is one of the major bottlenecks in the system's performance. It ha...
Jungeun Kim, Taewhan Kim
ICCAD
1997
IEEE
112views Hardware» more  ICCAD 1997»
13 years 11 months ago
Circuit optimization via adjoint Lagrangians
The circuit tuning problem is best approached by means of gradient-based nonlinear optimization algorithms. For large circuits, gradient computation can be the bottleneck in the o...
Andrew R. Conn, Ruud A. Haring, Chandramouli Viswe...