5263 search results - page 565 / 1053 » Open Constraint Optimization |
204
click to vote
JUCS
2006
15 years 7 months ago
2006
: The seminal algorithm developed by Ron Cytron, Jeanne Ferrante and colleagues in 1989 for the placement of -nodes in a control flow graph is still widely used in commercial compi...
160
click to vote
MP
2006
15 years 7 months ago
2006
A method is proposed for finding the global minimum of a multivariate polynomial via sum of squares (SOS) relaxation over its gradient variety. That variety consists of all points ...
209
click to vote
CORR
2002
Springer
15 years 7 months ago
2002
Springer
Dealing with the NP-complete Dominating Set problem on graphs, we demonstrate the power of data reduction by preprocessing from a theoretical as well as a practical side. In parti...
206
click to vote
MOR
2000
15 years 6 months ago
2000
We consider the problem of scheduling a set of n jobs on m identical parallel machines so as to minimize the weighted sum of job completion times. This problem is NP-hard in the s...
184
click to vote
ORDER
2007
15 years 6 months ago
2007
On-line chain partitioning problem of on-line posets has been open for the past 20 years. The best known on-line algorithm uses 5w −1 4 chains to cover poset of width w. Felsner ...