Sciweavers

1355 search results - page 36 / 271
» Alternating Timed Automata over Bounded Time
Sort
View
CORR
2009
Springer
115views Education» more  CORR 2009»
13 years 5 months ago
Testing the Equivalence of Regular Languages
The minimal deterministic finite automaton is generally used to determine regular languages equality. Using Brzozowski's notion of derivative, Antimirov and Mosses proposed a...
Marco Almeida, Nelma Moreira, Rogério Reis
IJFCS
2008
130views more  IJFCS 2008»
13 years 7 months ago
Equivalence of Labeled Markov Chains
We consider the equivalence problem for labeled Markov chains (LMCs), where each state is labeled with an observation. Two LMCs are equivalent if every finite sequence of observat...
Laurent Doyen, Thomas A. Henzinger, Jean-Fran&cced...
CA
2000
IEEE
14 years 1 days ago
Adaptive Simulation of Soft Bodies in Real-Time
This paper presents an adaptive technique to animate deformable bodies in real-time. In contrast to most previous work, we introduce a multi-resolution model that locally refines...
Gilles Debunne, Mathieu Desbrun, Marie-Paule Cani,...
AAAI
1992
13 years 8 months ago
Inferring Finite Automata with Stochastic Output Functions and an Application to Map Learning
It is often useful for a robot to construct a spatial representation of its environment from experiments and observations, in other words, to learn a map of its environment by exp...
Thomas Dean, Dana Angluin, Kenneth Basye, Sean P. ...
ICML
1999
IEEE
14 years 8 months ago
The Alternating Decision Tree Learning Algorithm
The applicationofboosting procedures to decision tree algorithmshas been shown to produce very accurate classi ers. These classiers are in the form of a majority vote over a numbe...
Yoav Freund, Llew Mason