Sciweavers

773 search results - page 47 / 155
» Traversing the Machining Graph
Sort
View
ENTCS
2008
120views more  ENTCS 2008»
14 years 9 months ago
Reasoning about B+ Trees with Operational Semantics and Separation Logic
The B+ tree is an ordered tree structure with a fringe list. It is the most widely used data structure for data organisation and searching in database systems specifically, and, p...
Alan P. Sexton, Hayo Thielecke
VLSID
2002
IEEE
142views VLSI» more  VLSID 2002»
15 years 10 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...
DAC
1994
ACM
15 years 1 months ago
BDD Variable Ordering for Interacting Finite State Machines
We address the problem of obtaining good variable orderings for the BDD representation of a system of interacting finite state machines (FSMs). Orderings are derived from the comm...
Adnan Aziz, Serdar Tasiran, Robert K. Brayton
AHS
2006
IEEE
188views Hardware» more  AHS 2006»
15 years 1 months ago
Finite State Machine IP Watermarking: A Tutorial
Sharing Intellectual Property (IP) blocks in today's competitive market poses significant high security risks. In this paper, we present a tutorial for a watermarking approach...
Amr T. Abdel-Hamid, Sofiène Tahar, El Mosta...
CLOUDCOM
2009
Springer
15 years 1 months ago
Cost-Minimizing Scheduling of Workflows on a Cloud of Memory Managed Multicore Machines
Workflows are modeled as hierarchically structured directed acyclic graphs in which vertices represent computational tasks, referred to as requests, and edges represent precedent c...
Nicolas G. Grounds, John K. Antonio, Jeffrey T. Mu...