7065 search results - page 397 / 1413 » Iterative Scheduling Algorithms |
181
Voted
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
We have recently proposed an EM-style algorithm to optimize log-linear models with hidden variables. In this paper, we use this algorithm to optimize a hidden conditional random ï...
152
click to vote
VLSID
2005
IEEE
16 years 7 months ago
2005
IEEE
Timing margin (slack) needs to be carefully managed to ensure a satisfactory timing yield. We propose a new design flow that combines a false-path-aware gate sizing and a statisti...
167
click to vote
ICALP
2007
Springer
16 years 1 months ago
2007
Springer
In this paper, we consider the mechanism design version of the fractional variant of the scheduling problem on unrelated machines. We give a lower bound of 2 − 1/n for any fracti...
203
click to vote
ISCAS
2006
IEEE
16 years 26 days ago
2006
IEEE
In this paper we present two polynomial time-complexity heuristic algorithms for optimization of gate-oxide leakage (tunneling current) during behavioral synthesis through simulta...
190
click to vote
ICOIN
2005
Springer
16 years 10 days ago
2005
Springer
Abstract. In optical networks, traffic demands often demonstrate periodic nature for which time-overlapping property can be utilized in routing and wavelength assignment (RWA). A R...