72 search results - page 9 / 15 » On a syntactic approximation to logics that capture complexi... |
ICANNGA
2007
Springer
13 years 11 months ago
2007
Springer
Predictions computed by a classification tree are usually constant on axis-parallel hyperrectangles corresponding to the leaves and have strict jumps on their boundaries. The densi...
FOSSACS
2008
Springer
13 years 9 months ago
2008
Springer
We study complexity issues related to the model-checking problem for LTL with registers (a.k.a. freeze LTL) over one-counter automata. We consider several classes of one-counter au...
CORR
2008
Springer
13 years 9 months ago
2008
Springer
In this paper we introduce a general framework for defining the depth of a sequence with respect to a class of observers. We show that our general framework captures all depth not...
AUTOMATICA
1999
13 years 7 months ago
1999
This paper proposes a framework for modeling and controlling systems described by interdependent physical laws, logic rules, and operating constraints, denoted as mixed logical dy...
ICCD
2005
IEEE
14 years 4 months ago
2005
IEEE
In this paper, we make two major contributions: First, to enhance Boolean learning, we propose a new class of logic implications called extended forward implications. Using a nove...