3628 search results - page 240 / 726 » The Decision Diffie-Hellman Problem |
147
click to vote
ISER
2000
Springer
15 years 8 months ago
2000
Springer
: Automatic model construction is a core problem in mobile robotics. To solve this task efficiently, we need a motion strategy to guide a robot equipped with a range sensor through...
136
click to vote
ALENEX
2007
15 years 6 months ago
2007
In polyhedral studies of 0/1 polytopes two prominent problems exist. One is the vertex enumeration problem: Given a system of inequalities, enumerate its feasible 0/1 points. Anot...
136
click to vote
PERCOM
2007
ACM
16 years 4 months ago
2007
ACM
We consider sensor scheduling as the optimal observability problem for partially observable Markov decision processes (POMDP). This model fits to the cases where a Markov process ...
187
click to vote
FSTTCS
2010
Springer
15 years 2 months ago
2010
Springer
We study the computational complexity of basic decision problems for one-counter simple stochastic games (OC-SSGs), under various objectives. OC-SSGs are 2-player turn-based stoch...
158
click to vote
ICML
1998
IEEE
16 years 5 months ago
1998
IEEE
Production scheduling, the problem of sequentially con guring a factory to meet forecasted demands, is a critical problem throughout the manufacturing industry. The requirement of...