Sciweavers

354 search results - page 49 / 71
» Approximate Option Pricing
Sort
View
87
Voted
CCE
2004
14 years 9 months ago
An algorithmic framework for improving heuristic solutions: Part II. A new version of the stochastic traveling salesman problem
The algorithmic framework developed for improving heuristic solutions of the new version of deterministic TSP [Choi et al., 2002] is extended to the stochastic case. To verify the...
Jaein Choi, Jay H. Lee, Matthew J. Realff
INFOCOM
2000
IEEE
15 years 2 months ago
QoS Routing with Performance-Dependent Costs
Abstract—We study a network model in which each network link is associated with a set of delays and costs. These costs are a function of the delays and reflect the prices paid i...
Funda Ergün, Rakesh K. Sinha, Lisa Zhang
SIAMCOMP
2010
174views more  SIAMCOMP 2010»
14 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
63
Voted
ATAL
2008
Springer
14 years 11 months ago
Nonuniform bribery
We study the concept of bribery in the situation where voters are willing to change their votes as we ask them, but where their prices depend on the nature of the change we reques...
Piotr Faliszewski
CSCLP
2007
Springer
15 years 3 months ago
Combining Two Structured Domains for Modeling Various Graph Matching Problems
Abstract. Graph pattern matching is a central application in many fields. In various areas, the structure of the pattern can only be approximated and exact matching is then too ac...
Yves Deville, Grégoire Dooms, Stépha...