Sciweavers

567 search results - page 8 / 114
» Exact train pathing
Sort
View
22
Voted
ICRA
2008
IEEE
135views Robotics» more  ICRA 2008»
14 years 1 months ago
Path and trajectory diversity: Theory and algorithms
— We present heuristic algorithms for pruning large sets of candidate paths or trajectories down to smaller subsets that maintain desirable characteristics in terms of overall re...
Michael S. Branicky, Ross A. Knepper, James J. Kuf...
FUIN
2007
116views more  FUIN 2007»
13 years 7 months ago
Path Compression in Timed Automata
The paper presents a method of abstraction for timed systems. To extract an abstract model of a timed system we propose to use static analysis, namely a technique called path compr...
Agata Janowska, Wojciech Penczek
ISVLSI
2005
IEEE
115views VLSI» more  ISVLSI 2005»
14 years 21 days ago
Quasi-Exact BDD Minimization Using Relaxed Best-First Search
In this paper we present a new method for quasiexact optimization of BDDs using relaxed ordered best-first search. This general method is applied to BDD minimization. In contrast...
Rüdiger Ebendt, Rolf Drechsler
WSC
2004
13 years 8 months ago
Exact Simulation of Option Greeks under Stochastic Volatility and Jump Diffusion Models
This paper derives Monte Carlo simulation estimators to compute option price derivatives, i.e., the `Greeks,' under Heston's stochastic volatility model and some variant...
Mark Broadie, Özgür Kaya
ICRA
2009
IEEE
106views Robotics» more  ICRA 2009»
14 years 1 months ago
On-line time-optimal path tracking for robots
— This paper focuses on time-optimal path tracking, which involves planning of robot motions along prescribed geometric paths. Starting from a discretized convex reformulation of...
Diederik Verscheure, Moritz Diehl, Joris De Schutt...