Sciweavers

875 search results - page 74 / 175
» On Reachability Under Uncertainty
Sort
View
IJCAI
2001
15 years 2 months ago
An Improved Grid-Based Approximation Algorithm for POMDPs
Although a partially observable Markov decision process (POMDP) provides an appealing model for problems of planning under uncertainty, exact algorithms for POMDPs are intractable...
Rong Zhou, Eric A. Hansen
61
Voted
COLING
1994
15 years 2 months ago
Chinese Segmentation Disambiguation
A technique of reasoning under uncertainty is studied in all attempt to solve disaml)igua,tion probh;nls of Cilinesc segnlcnliation. A knowlcdge-.I)a,sedinexact reasoning thcory i...
Wanying Jin
87
Voted
VLSID
2002
IEEE
142views VLSI» more  VLSID 2002»
16 years 1 months ago
Degree-of-Freedom Analysis for Sequential Machines Targeting BIST Quality and Gate Area
| This paper reports the design of BIST structures for sequential machines. Testability of an FSM is limited due to the fact that some machine states remain unreachable and some ac...
Samir Roy, Biplab K. Sikdar, Monalisa Mukherjee, D...
111
Voted
GI
2007
Springer
15 years 7 months ago
Test Automation Meets Static Analysis
: In this article we advocate an integrated approach for the automation of module or software integration testing and static analysis. It is illustrated how funmethods of static an...
Jan Peleska, Helge Löding, Tatiana Kotas
94
Voted
ACSD
2006
IEEE
80views Hardware» more  ACSD 2006»
15 years 6 months ago
Schedulability Analysis of Petri Nets Based on Structural Properties
A schedule of a Petri Net (PN) represents a set of firing sequences that can be infinitely repeated within a bounded state space, regardless of the outcomes of the nondeterminis...
Cong Liu, Alex Kondratyev, Yosinori Watanabe, Albe...