Sciweavers

5263 search results - page 499 / 1053
» Open Constraint Optimization
Sort
View
NOMS
2006
IEEE
16 years 29 days ago
An Enhanced Estimator to Multi-objective OSPF Weight Setting Problem
— Open Shortest Path First (OSPF) is a routing protocol which is widely used in the Industry. Its functionality mainly depends on the weights assigned to the links. Given the tra...
Mohammed H. Sqalli, Sadiq M. Sait, Mohammed Aijaz ...
PLDI
2004
ACM
16 years 11 days ago
Inducing heuristics to decide whether to schedule
Instruction scheduling is a compiler optimization that can improve program speed, sometimes by 10% or more—but it can also be expensive. Furthermore, time spent optimizing is mo...
John Cavazos, J. Eliot B. Moss
AAAI
2004
15 years 8 months ago
Methods for Boosting Revenue in Combinatorial Auctions
We study the recognized open problem of designing revenuemaximizing combinatorial auctions. It is unsolved even for two bidders and two items for sale. Rather than pursuing the pu...
Anton Likhodedov, Tuomas Sandholm
CORR
2010
Springer
167views Education» more  CORR 2010»
15 years 7 months ago
Network Flow Algorithms for Structured Sparsity
We consider a class of learning problems that involve a structured sparsityinducing norm defined as the sum of -norms over groups of variables. Whereas a lot of effort has been pu...
Julien Mairal, Rodolphe Jenatton, Guillaume Obozin...
CORR
2006
Springer
90views Education» more  CORR 2006»
15 years 7 months ago
Path-independent load balancing with unreliable machines
We consider algorithms for load balancing on unreliable machines. The objective is to optimize the two criteria of minimizing the makespan and minimizing job reassignments in resp...
James Aspnes, Yang Richard Yang, Yitong Yin