Sciweavers

36 search results - page 2 / 8
» Partially directed paths in a wedge
Sort
View
DAGSTUHL
2006
13 years 6 months ago
Enriched categories and models for spaces of dipaths
Partially ordered sets, causets, partially ordered spaces and their local counterparts are now often used to model systems in computer science and theoretical physics. The order mo...
Timothy Porter
ICTAI
2000
IEEE
13 years 9 months ago
Building efficient partial plans using Markov decision processes
Markov Decision Processes (MDP) have been widely used as a framework for planning under uncertainty. They allow to compute optimal sequences of actions in order to achieve a given...
Pierre Laroche
PR
2007
134views more  PR 2007»
13 years 4 months ago
An elastic partial shape matching technique
We consider the problem of partial shape matching. We propose to transform shapes into sequences and utilize an algorithm that determines a subsequence of a target sequence that b...
Longin Jan Latecki, Vasileios Megalooikonomou, Qia...
ICCAD
1994
IEEE
74views Hardware» more  ICCAD 1994»
13 years 9 months ago
Non-scan design-for-testability of RT-level data paths
- This paper presents a non-scan design-for-testability technique applicable to register-transfer(RT) level data path circuits, which are usually very hard-to-test due to the prese...
Sujit Dey, Miodrag Potkonjak
IJFCS
1998
67views more  IJFCS 1998»
13 years 5 months ago
Vertex Splitting in Dags and Applications to Partial Scan Designs and Lossy Circuits
Directed acyclic graphs (dags) are often used to model circuits. Path lengths in such dags represent circuit delays. In the vertex splitting problem, the objective is to determine...
Doowon Paik, Sudhakar M. Reddy, Sartaj Sahni