Sciweavers

181 search results - page 11 / 37
» Effective characterizations of tree logics
Sort
View
MST
2006
129views more  MST 2006»
13 years 7 months ago
Reachability Problems on Regular Ground Tree Rewriting Graphs
We consider the transition graphs of regular ground tree (or term) rewriting systems. The vertex set of such a graph is a (possibly infinite) set of trees. Thus, with a finite tree...
Christof Löding
IJCAI
1989
13 years 8 months ago
Filter Preferential Entailment for the Logic of Action in Almost Continuous Worlds
Mechanical systems, of the kinds which are of interest for qualitative reasoning, are characterized by a set of real-valued parameters, each of which is a piecewise continuous fun...
Erik Sandewall
KDD
2007
ACM
165views Data Mining» more  KDD 2007»
14 years 8 months ago
Efficient and effective explanation of change in hierarchical summaries
Dimension attributes in data warehouses are typically hierarchical (e.g., geographic locations in sales data, URLs in Web traffic logs). OLAP tools are used to summarize the measu...
Deepak Agarwal, Dhiman Barman, Dimitrios Gunopulos...
ICCD
2006
IEEE
123views Hardware» more  ICCD 2006»
14 years 4 months ago
Steady and Transient State Analysis of Gate Leakage Current in Nanoscale CMOS Logic Gates
Abstract— Gate leakage (direct tunneling current for sub65nm CMOS) can severely affect both the transient and steady state behaviors of CMOS circuits. In this paper we quantify t...
Saraju P. Mohanty, Elias Kougianos
HASE
1998
IEEE
13 years 11 months ago
Combining Various Solution Techniques for Dynamic Fault Tree Analysis of Computer Systems
Fault trees provide a graphical and logical framework for analyzing the reliability of systems. A fault tree provides a conceptually simple modeling framework to represent the sys...
Ragavan Manian, Joanne Bechta Dugan, David Coppit,...