Sciweavers

711 search results - page 94 / 143
» Optimal placement by branch-and-price
Sort
View
ASPDAC
2007
ACM
105views Hardware» more  ASPDAC 2007»
13 years 12 months ago
An Efficient Computation of Statistically Critical Sequential Paths Under Retiming
Abstract-- In this paper we present the Statistical Retimingbased Timing Analysis (SRTA) algorithm. The goal is to compute the timing slack distribution for the nodes in the timing...
Mongkol Ekpanyapong, Xin Zhao, Sung Kyu Lim
PAMI
2010
215views more  PAMI 2010»
13 years 6 months ago
Fusion Moves for Markov Random Field Optimization
—The efficient application of graph cuts to Markov Random Fields (MRFs) with multiple discrete or continuous labels remains an open question. In this paper, we demonstrate one p...
Victor S. Lempitsky, Carsten Rother, Stefan Roth, ...
PLDI
2000
ACM
14 years 6 days ago
A framework for interprocedural optimization in the presence of dynamic class loading
Dynamic class loading during program execution in the JavaTM Programming Language is an impediment for generating code that is as e cient as code generated using static wholeprogr...
Vugranam C. Sreedhar, Michael G. Burke, Jong-Deok ...
COLCOM
2008
IEEE
14 years 2 months ago
Replication in Overlay Networks: A Multi-objective Optimization Approach
Recently, overlay network-based collaborative applications such as instant messaging, content sharing, and Internet telephony are becoming increasingly popular. Many of these appli...
Osama Al-Haj Hassan, Lakshmish Ramaswamy, John A. ...
MOBIQUITOUS
2007
IEEE
14 years 2 months ago
Optimal Relay Node Fault Recovery
—Topology control problems are concerned with the assignment of power levels to the nodes of an ad-hoc network so as to maintain a specified network topology while minimizing th...
Fei Che, Liang Zhao, Errol L. Lloyd