Sciweavers

923 search results - page 101 / 185
» On the Topology of Discrete Strategies
Sort
View
SODA
2010
ACM
160views Algorithms» more  SODA 2010»
14 years 6 months ago
Solving Simple Stochastic Tail Games
Stochastic games are a natural model for open reactive processes: one player represents the controller and his opponent represents a hostile environment. The evolution of the syste...
Hugo Gimbert, Florian Horn
NCA
2005
IEEE
14 years 2 months ago
Using Residual Times to Meet Deadlines in M/G/C Queues
In systems where customer service demands are only known probabilistically, there is very little to distinguish between jobs. Therefore, no universal optimum scheduling strategy o...
Sarah Tasneem, Lester Lipsky, Reda A. Ammar, Howar...
COMPGEOM
1994
ACM
14 years 1 months ago
Competitive Searching in a Generalized Street
We consider the problem of a robot which has to find a target in an unknown simple polygon, based only on what it has seen so far. A street is a polygon for which the two boundary...
Amitava Datta, Christian Icking
ICA
2007
Springer
14 years 1 months ago
Conjugate Gamma Markov Random Fields for Modelling Nonstationary Sources
In modelling nonstationary sources, one possible strategy is to define a latent process of strictly positive variables to model variations in second order statistics of the underly...
Ali Taylan Cemgil, Onur Dikmen
RAS
2002
105views more  RAS 2002»
13 years 8 months ago
Visually guided manipulation tasks
In this paper, we present a framework for a robotic system with the ability to perform real-world manipulation tasks. The complexity of such tasks determines the precision and fre...
Danica Kragic, Lars Petersson, Henrik I. Christens...