1403 search results - page 36 / 281 » About Approximations of Exponentials |
107
click to vote
COCOON
2006
Springer
15 years 2 months ago
2006
Springer
Abstract. While the complexity of min-max and min-max regret versions of most classical combinatorial optimization problems has been thoroughly investigated, there are very few stu...
96
Voted
CORR
2002
Springer
14 years 11 months ago
2002
Springer
In a seminal paper in 1973, Black and Scholes argued how expected distributions of stock prices can be used to price options. Their model assumed a directed random motion for the ...
103
click to vote
JACIII
2007
14 years 11 months ago
2007
We study the problem of approximating pseudoBoolean functions by linear pseudo-Boolean functions. Pseudo-Boolean functions generalize ordinary Boolean functions by allowing the fu...
STOC
2002
ACM
15 years 11 months ago
2002
ACM
Given a set S of n points in IRd , a (t, )-approximate Voronoi diagram (AVD) is a partition of space into constant complexity cells, where each cell c is associated with t represe...
105
click to vote
ISAAC
2005
Springer
15 years 4 months ago
2005
Springer
Abstract. We consider bicriteria optimization problems and investigate the relationship between two standard approaches to solving them: (i) computing the Pareto curve and (ii) the...