Sciweavers

9284 search results - page 310 / 1857
» Knowledge State Algorithms
Sort
View
FGR
1996
IEEE
100views Biometrics» more  FGR 1996»
15 years 11 months ago
Recovering the Temporal Structure of Natural Gesture
A method for the recovery of the temporal structure and phasesin natural gesture is presented. The work is motivated by recent developments in the theory of natural gesture which ...
Andrew D. Wilson, Aaron F. Bobick, Justine Cassell
ASE
2010
126views more  ASE 2010»
15 years 7 months ago
Generating a checking sequence with a minimum number of reset transitions
Given a finite state machine M, a checking sequence is an input sequence that is guaranteed to lead to a failure if the implementation under test is faulty and has no more states t...
Robert M. Hierons, Hasan Ural
CORR
2010
Springer
109views Education» more  CORR 2010»
15 years 7 months ago
Fast simulation of large-scale growth models
We give an algorithm that computes the final state of certain growth models without computing all intermediate states. Our technique is based on a "least action principle"...
Tobias Friedrich, Lionel Levine
IJAR
2007
130views more  IJAR 2007»
15 years 7 months ago
Bayesian network learning algorithms using structural restrictions
The use of several types of structural restrictions within algorithms for learning Bayesian networks is considered. These restrictions may codify expert knowledge in a given domai...
Luis M. de Campos, Javier Gomez Castellano
AI
1998
Springer
15 years 11 months ago
A Hybrid Genetic Algorithm for the Vehicle Routing Problem with Time Windows
A variety of hybrid genetic algorithms has been recently proposed to address the vehicle routing problem with time windows (VRPTW), a problem known to be NP-hard. However, very few...
Jean Berger, Martin Salois, Regent Begin