3475 search results - page 528 / 695 » Backbones in Optimization and Approximation |
186
click to vote
SIGECOM
2010
ACM
15 years 11 months ago
2010
ACM
We study the problem of selling identical goods to n unit-demand bidders in a setting in which the total supply of goods is unknown to the mechanism. Items arrive dynamically, and...
139
click to vote
ISPD
1997
ACM
15 years 10 months ago
1997
ACM
A linear wirelength objective more e ectively captures timing, congestion, and other global placement considerations than a squared wirelength objective. The GORDIAN-L cell placem...
187
click to vote
SODA
2003
ACM
15 years 7 months ago
2003
ACM
The natural relaxation for the Group Steiner Tree problem, as well as for its generalization, the Directed Steiner Tree problem, is a flow-based linear programming relaxation. We...
173
click to vote
WSC
2000
15 years 7 months ago
2000
We present a technique for analyzing a simulation metamodel that has been constructed using a variancestabilizing transformation. To compute a valid confidence interval for the ex...
170
click to vote
GECCO
2008
Springer
15 years 7 months ago
2008
Springer
Based in part on observations about the incremental nature of most state changes in biological systems, we introduce the idea of Memory with Memory in Genetic Programming (GP), wh...