Sciweavers

3628 search results - page 251 / 726
» The Decision Diffie-Hellman Problem
Sort
View
ECML
2006
Springer
15 years 6 months ago
Reinforcement Learning for MDPs with Constraints
In this article, I will consider Markov Decision Processes with two criteria, each defined as the expected value of an infinite horizon cumulative return. The second criterion is e...
Peter Geibel
APAL
2010
117views more  APAL 2010»
15 years 4 months ago
The complexity of temporal logic over the reals
It is shown that the decision problem for the temporal logic with until and since connectives over real-numbers time is PSPACE-complete. This is the most practically useful dense ...
M. Reynolds
DAM
2008
102views more  DAM 2008»
15 years 4 months ago
On the computational complexity of partial covers of Theta graphs
By use of elementary geometric arguments we prove the existence of a special integral solution of a certain system of linear equations. The existence of such a solution yields the...
Jirí Fiala, Jan Kratochvíl, Attila P...
CORR
2007
Springer
98views Education» more  CORR 2007»
15 years 4 months ago
Realistic Rendering of Kinetostatic Indices of Mechanisms
: The work presented in this paper is related to the use of a haptic device in an environment of robotic simulation. Such device introduces a new approach to feel and to understand...
Damien Chablat, Fouad Bennis
JOT
2006
82views more  JOT 2006»
15 years 4 months ago
Planning before plans
A plan is a blueprint for solving a problem. It summarizes the decisions that have been made during the planning of that solution. In this month's issue of Strategic Software...
John D. McGregor