Sciweavers

2924 search results - page 322 / 585
» Lower Bounds in Distributed Computing
Sort
View
MANSCI
2006
82views more  MANSCI 2006»
15 years 4 months ago
Pricing American-Style Derivatives with European Call Options
We present a new approach to pricing American-style derivatives that is applicable to any Markovian setting (i.e., not limited to geometric Brownian motion) for which European cal...
Scott B. Laprise, Michael C. Fu, Steven I. Marcus,...
IPL
2002
74views more  IPL 2002»
15 years 4 months ago
Restricted rotation distance between binary trees
Restricted rotation distance between pairs of rooted binary trees measures differences in tree shape and is related to rotation distance. In restricted rotation distance, the rota...
Sean Cleary
ICRA
2010
IEEE
130views Robotics» more  ICRA 2010»
15 years 3 months ago
On the complexity of optimal reconfiguration planning for modular reconfigurable robots
— This paper presents a thorough analysis of the computational complexity of optimal reconfiguration planning problem for chain-type modular robots, i.e. finding the least number...
Feili Hou, Wei-Min Shen
INFORMS
2010
125views more  INFORMS 2010»
15 years 3 months ago
Combining Exact and Heuristic Approaches for the Capacitated Fixed-Charge Network Flow Problem
We develop a solution approach for the fixed charge network flow problem (FCNF) that produces provably high-quality solutions quickly. The solution approach combines mathematica...
Mike Hewitt, George L. Nemhauser, Martin W. P. Sav...
139
Voted
SIAMSC
2010
160views more  SIAMSC 2010»
15 years 2 months ago
Shift-Invert Arnoldi Approximation to the Toeplitz Matrix Exponential
The shift-invert Arnoldi method is employed to generate an orthonormal basis from the Krylov subspace corresponding to a real Toeplitz matrix and an initial vector. The vectors and...
Spike T. Lee, Hong-Kui Pang, Hai-Wei Sun