Sciweavers

324 search results - page 34 / 65
» Guessing based on length functions
Sort
View
CPE
1998
Springer
80views Hardware» more  CPE 1998»
13 years 12 months ago
Probability, Parallelism and the State Space Exploration Problem
We present a new dynamic probabilistic state exploration algorithm based on hash compaction. Our method has a low state omission probability and low memory usage that is independen...
William J. Knottenbelt, Mark Mestern, Peter G. Har...
WSC
2007
13 years 10 months ago
Low bias integrated path estimators
We consider the problem of estimating the time-average variance constant for a stationary process. A previous paper described an approach based on multiple integrations of the sim...
James M. Calvin
EOR
2006
65views more  EOR 2006»
13 years 7 months ago
Dynamic programming and minimum risk paths
: This paper addresses the problem of computing minimum risk paths by taking as objective the expected accident cost. The computation is based on a dynamic programming formulation ...
Paolo Serafini
ICDAR
2009
IEEE
13 years 5 months ago
Online Handwritten Japanese Character String Recognition Using Conditional Random Fields
This paper describes an online handwritten Japanese character string recognition system based on conditional random fields, which integrates the information of character recogniti...
Xiang-Dong Zhou, Cheng-Lin Liu, Masaki Nakagawa
BC
1998
98views more  BC 1998»
13 years 7 months ago
The dynamics of long-term exploration in the rat
A simple analytical model is proposed here that captures to a large extent the kinematic structure of rat exploratory behavior. Previous studies have shown that such behavior consi...
Ofer Tchernichovski, Yoav Benjamini, Ilan Golani