Sciweavers

383 search results - page 54 / 77
» Discrete piecewise linear functions
Sort
View
SIAMCOMP
2010
174views more  SIAMCOMP 2010»
13 years 8 months ago
On the Complexity of Nash Equilibria and Other Fixed Points
We reexamine what it means to compute Nash equilibria and, more generally, what it means to compute a fixed point of a given Brouwer function, and we investigate the complexity o...
Kousha Etessami, Mihalis Yannakakis
COCOA
2007
Springer
14 years 4 months ago
Fundamental Domains for Integer Programs with Symmetries
We define a fundamental domain for a linear programming relaxation of a combinatorial integer program which is symmetric under a group action. We then describe a straightforward w...
Eric J. Friedman
JSCIC
2008
148views more  JSCIC 2008»
13 years 10 months ago
Finite Element-Based Level Set Methods for Higher Order Flows
In this paper we shall discuss the numerical simulation of higher order geometric flows by level set methods. Main examples under considerations are surface diffusion and the Will...
Martin Burger, Christina Stöcker, Axel Voigt
MP
1998
109views more  MP 1998»
13 years 10 months ago
Rounding algorithms for covering problems
In the last 25 years approximation algorithms for discrete optimization problems have been in the center of research in the fields of mathematical programming and computer science...
Dimitris Bertsimas, Rakesh V. Vohra
IJAR
2006
98views more  IJAR 2006»
13 years 10 months ago
Inference in hybrid Bayesian networks with mixtures of truncated exponentials
Mixtures of truncated exponentials (MTE) potentials are an alternative to discretization for solving hybrid Bayesian networks. Any probability density function can be approximated...
Barry R. Cobb, Prakash P. Shenoy