Sciweavers

354 search results - page 41 / 71
» Approximate Option Pricing
Sort
View
JEA
2008
112views more  JEA 2008»
13 years 7 months ago
Dynamic spatial approximation trees
The Spatial Approximation Tree (sa-tree) is a recently proposed data structure for searching in metric spaces. It has been shown that it compares favorably against alternative data...
Gonzalo Navarro, Nora Reyes
AGENTS
2001
Springer
14 years 4 days ago
Using background knowledge to speed reinforcement learning in physical agents
This paper describes Icarus, an agent architecture that embeds a hierarchical reinforcement learning algorithm within a language for specifying agent behavior. An Icarus program e...
Daniel G. Shapiro, Pat Langley, Ross D. Shachter
ESA
2007
Springer
97views Algorithms» more  ESA 2007»
14 years 1 months ago
To Fill or Not to Fill: The Gas Station Problem
In this paper we study several routing problems that generalize shortest paths and the Traveling Salesman Problem. We consider a more general model that incorporates the actual co...
Samir Khuller, Azarakhsh Malekian, Julián M...
DSS
2008
123views more  DSS 2008»
13 years 7 months ago
Delayed multiattribute product differentiation
We develop a two-stage model for versioning products with respect to both vertical and horizontal attributes. At first, a firm positions its top-quality "flagship" produ...
Thomas A. Weber
FOCS
2007
IEEE
14 years 1 months ago
Mechanism Design via Differential Privacy
We study the role that privacy-preserving algorithms, which prevent the leakage of specific information about participants, can play in the design of mechanisms for strategic age...
Frank McSherry, Kunal Talwar