Sciweavers

1921 search results - page 85 / 385
» Making AC-3 an Optimal Algorithm
Sort
View
MICRO
2002
IEEE
113views Hardware» more  MICRO 2002»
14 years 1 months ago
Vacuum packing: extracting hardware-detected program phases for post-link optimization
This paper presents Vacuum Packing, a new approach to profile-based program optimization. Instead of using traditional aggregate or summarized execution profile weights, this ap...
Ronald D. Barnes, Erik M. Nystrom, Matthew C. Mert...
CORR
2010
Springer
136views Education» more  CORR 2010»
13 years 9 months ago
Optimally Sparse Frames
Frames have established themselves as a means to derive redundant, yet stable decompositions of a signal for analysis or transmission, while also promoting sparse expansions. Howe...
Peter G. Casazza, Andreas Heinecke, Felix Krahmer,...
MOR
2006
81views more  MOR 2006»
13 years 9 months ago
Simulated Annealing for Convex Optimization
We apply the method known as simulated annealing to the following problem in convex optimization: minimize a linear function over an arbitrary convex set, where the convex set is ...
Adam Tauman Kalai, Santosh Vempala
SIAMJO
2008
114views more  SIAMJO 2008»
13 years 9 months ago
An Inexact SQP Method for Equality Constrained Optimization
We present an algorithm for large-scale equality constrained optimization. The method is based on a characterization of inexact sequential quadratic programming (SQP) steps that ca...
Richard H. Byrd, Frank E. Curtis, Jorge Nocedal
INFOCOM
2006
IEEE
14 years 3 months ago
Super-Fast Delay Tradeoffs for Utility Optimal Fair Scheduling in Wireless Networks
— We consider the fundamental delay tradeoffs for utility optimal scheduling in a general network with time varying channels. A network controller acts on randomly arriving data ...
Michael J. Neely