Sciweavers

48 search results - page 8 / 10
» Partial Lagrangian relaxation for general quadratic programm...
Sort
View
PLDI
2006
ACM
14 years 1 months ago
A global progressive register allocator
This paper describes a global progressive register allocator, a register allocator that uses an expressive model of the register allocation problem to quickly find a good allocat...
David Ryan Koes, Seth Copen Goldstein
STOC
2005
ACM
156views Algorithms» more  STOC 2005»
14 years 8 months ago
Convex programming for scheduling unrelated parallel machines
We consider the classical problem of scheduling parallel unrelated machines. Each job is to be processed by exactly one machine. Processing job j on machine i requires time pij . ...
Yossi Azar, Amir Epstein
FOCS
2006
IEEE
14 years 1 months ago
Improved approximation algorithms for multidimensional bin packing problems
In this paper we introduce a new general framework for set covering problems, based on the combination of randomized rounding of the (near-)optimal solution of the Linear Programm...
Nikhil Bansal, Alberto Caprara, Maxim Sviridenko
ICML
2004
IEEE
14 years 8 months ago
Learning associative Markov networks
Markov networks are extensively used to model complex sequential, spatial, and relational interactions in fields as diverse as image processing, natural language analysis, and bio...
Benjamin Taskar, Vassil Chatalbashev, Daphne Kolle...
TASE
2008
IEEE
13 years 7 months ago
New Solution Approaches to the General Single- Machine Earliness-Tardiness Problem
This paper addresses the general single-machine earliness-tardiness problem with distinct release dates, due dates, and unit costs. The aim of this research is to obtain an exact n...
Hoksung Yau, Yunpeng Pan, Leyuan Shi