Sciweavers

2467 search results - page 185 / 494
» Finite State Machines
Sort
View
CORR
2008
Springer
141views Education» more  CORR 2008»
15 years 6 months ago
Model checking memoryful linear-time logics over one-counter automata
We study complexity of the model-checking problems for LTL with registers (also known as freeze LTL and written LTL ) and for first-order logic with data equality tests (written F...
Stéphane Demri, Ranko Lazic, Arnaud Sangnie...
AI
2006
Springer
15 years 6 months ago
Robot introspection through learned hidden Markov models
In this paper we describe a machine learning approach for acquiring a model of a robot behaviour from raw sensor data. We are interested in automating the acquisition of behaviour...
Maria Fox, Malik Ghallab, Guillaume Infantes, Dere...
ICDE
2007
IEEE
120views Database» more  ICDE 2007»
16 years 28 days ago
Optimizing State-Intensive Non-Blocking Queries Using Run-time Adaptation
Main memory is a critical resource when processing non-blocking queries with state intensive operators that require real-time responses. While partitioned parallel processing can ...
Bin Liu, Mariana Jbantova, Elke A. Rundensteiner
162
Voted
ACRI
2006
Springer
16 years 18 days ago
Optimal 6-State Algorithms for the Behavior of Several Moving Creatures
The goal of our investigation is to find automatically the absolutely best rule for a moving creature in a cellular field. The task of the creature is to visit all empty cells wi...
Mathias Halbach, Rolf Hoffmann, Lars Both
206
Voted
ECML
2005
Springer
16 years 4 days ago
Using Rewards for Belief State Updates in Partially Observable Markov Decision Processes
Partially Observable Markov Decision Processes (POMDP) provide a standard framework for sequential decision making in stochastic environments. In this setting, an agent takes actio...
Masoumeh T. Izadi, Doina Precup