Sciweavers

227 search results - page 3 / 46
» A Competitive Algorithm for the General 2-Server Problem
Sort
View
DAC
2012
ACM
11 years 9 months ago
ComPLx: A Competitive Primal-dual Lagrange Optimization for Global Placement
We develop a projected-subgradient primal-dual Lagrange optimization for global placement, that can be instantiated with a variety of interconnect models. It decomposes the origin...
Myung-Chul Kim, Igor L. Markov
EOR
2006
118views more  EOR 2006»
13 years 7 months ago
A random-key genetic algorithm for the generalized traveling salesman problem
The Generalized Traveling Salesman Problem is a variation of the well known Traveling Salesman Problem in which the set of nodes is divided into clusters; the objective is to find...
Lawrence V. Snyder, Mark S. Daskin
CSO
2009
IEEE
14 years 2 months ago
Competitive Analysis of Online Price Discount Replacement Problem
When a paid price discount activity occurs, the decisionmaker must decide whether or not and when to pay the additional fees for preferential price in an online fashion. This prob...
Lili Ding, Xinmin Liu, Wanglin Kang
ICALP
2011
Springer
12 years 10 months ago
On the Advice Complexity of the k-Server Problem
Competitive analysis is the established tool for measuring the output quality of algorithms that work in an online environment. Recently, the model of advice complexity has been in...
Hans-Joachim Böckenhauer, Dennis Komm, Rastis...
CVPR
2012
IEEE
11 years 9 months ago
A tiered move-making algorithm for general pairwise MRFs
A large number of problems in computer vision can be modeled as energy minimization problems in a markov random field (MRF) framework. Many methods have been developed over the y...
Vibhav Vineet, Jonathan Warrell, Philip H. S. Torr