Sciweavers

1182 search results - page 15 / 237
» Iterative Methods in Combinatorial Optimization
Sort
View
SMI
2007
IEEE
106views Image Analysis» more  SMI 2007»
15 years 6 months ago
Iterative Methods for Improving Mesh Parameterizations
We present two complementary methods for automatically improving mesh parameterizations and demonstrate that they provide a very desirable combination of efficiency and quality. ...
Shen Dong, Michael Garland
108
Voted
SIGECOM
2000
ACM
127views ECommerce» more  SIGECOM 2000»
15 years 4 months ago
Towards a universal test suite for combinatorial auction algorithms
General combinatorial auctions—auctions in which bidders place unrestricted bids for bundles of goods—are the subject of increasing study. Much of this work has focused on alg...
Kevin Leyton-Brown, Mark Pearson, Yoav Shoham
SIAMJO
2011
14 years 6 months ago
Approximating Semidefinite Packing Programs
In this paper we define semidefinite packing programs and describe an algorithm to approximately solve these problems. Semidefinite packing programs arise in many applications s...
Garud Iyengar, David J. Phillips, Clifford Stein
102
Voted
HIPEAC
2005
Springer
15 years 5 months ago
A Practical Method for Quickly Evaluating Program Optimizations
This article aims at making iterative optimization practical and usable by speeding up the evaluation of a large range of optimizations. Instead of using a full run to evaluate a s...
Grigori Fursin, Albert Cohen, Michael F. P. O'Boyl...
81
Voted
ICTAI
1994
IEEE
15 years 3 months ago
Iterative Strengthening: An Algorithm for Generating Anytime Optimal Plans
In order to perform adequately in real-world situations, a planning system must be able to nd the \best" solution while still supporting anytime behavior. We have developed ...
Randall J. Calistri-Yeh