Sciweavers

5493 search results - page 20 / 1099
» Effectively Polynomial Simulations
Sort
View
STOC
2002
ACM
80views Algorithms» more  STOC 2002»
16 years 2 days ago
Strict polynomial-time in simulation and extraction
The notion of efficient computation is usually identified in cryptography and complexity with (strict) probabilistic polynomial time. However, until recently, in order to obtain c...
Boaz Barak, Yehuda Lindell
AIPS
2011
14 years 3 months ago
A Polynomial All Outcome Determinization for Probabilistic Planning
Most predominant approaches in probabilistic planning utilize techniques from the more thoroughly investigated field of classical planning by determinizing the problem at hand. I...
Thomas Keller, Patrick Eyerich
DSP
2006
14 years 11 months ago
Multicomponent chirp signals analysis using product cubic phase function
This paper presents an algorithm for estimating the parameters of multicomponent chirp signals. The estimator is based on the cubic phase function (CPF), which is efficient to est...
Pu Wang, Jianyu Yang
ICRA
2007
IEEE
183views Robotics» more  ICRA 2007»
15 years 6 months ago
Global Trajectory Generation for Nonholonomic Robots in Dynamic Environments
— We consider the problem of generating global feasible trajectories for nonholonomic mobile robots in the presence of moving obstacles. The global trajectory is composed of regi...
Yi Guo, Yi Long, Weihua Sheng
TSMC
2010
14 years 6 months ago
Comparison of Optimal Solutions to Real-Time Path Planning for a Mobile Vehicle
In this paper, we present two near-optimal methods to determine the real-time collision-free path for a mobile vehicle moving in a dynamically changing environment. The proposed de...
Jian Yang, Zhihua Qu, Jing Wang 0005, Kevin L. Con...