Sciweavers

810 search results - page 34 / 162
» Defining implicit objective functions for design problems
Sort
View
CORR
2006
Springer
146views Education» more  CORR 2006»
13 years 9 months ago
Approximation Algorithms for Multi-Criteria Traveling Salesman Problems
In multi-criteria optimization, several objective functions are to be optimized. Since the different objective functions are usually in conflict with each other, one cannot conside...
Bodo Manthey, L. Shankar Ram
ESA
2008
Springer
108views Algorithms» more  ESA 2008»
13 years 10 months ago
Two-Stage Robust Network Design with Exponential Scenarios
Abstract. We study two-stage robust variants of combinatorial optimization problems like Steiner tree, Steiner forest, and uncapacitated facility location. The robust optimization ...
Rohit Khandekar, Guy Kortsarz, Vahab S. Mirrokni, ...

Publication
580views
15 years 8 months ago
Redistribution of VCG Payments in Assignment of Heterogeneous Objects
In this paper, we seek to design a Groves mechanism for assigning p heterogeneous objects among n competing agents (n > p) with unit demand, satisfying weak budget balance, in...
Sujit Gujar, Yadati Narahari
3DPVT
2004
IEEE
231views Visualization» more  3DPVT 2004»
14 years 20 days ago
A Variational Analysis of Shape from Specularities using Sparse Data
Looking around in our every day environment, many of the encountered objects are specular to some degree. Actively using this fact when reconstructing objects from image sequences...
Jan Erik Solem, Henrik Aanæs, Anders Heyden
PODS
2006
ACM
104views Database» more  PODS 2006»
14 years 9 months ago
Tractable database design through bounded treewidth
Given that most elementary problems in database design are NP-hard, the currently used database design algorithms produce suboptimal results. For example, the current 3NF decompos...
Georg Gottlob, Reinhard Pichler, Fang Wei