Sciweavers

851 search results - page 110 / 171
» Inaccessibility in Decision Procedures
Sort
View
TOCL
2008
128views more  TOCL 2008»
13 years 9 months ago
A comprehensive combination framework
fragment enjoys suitable noetherianity conditions and admits an abstract version of a `KeislerShelah like' isomorphism theorem. We show that this general decidability transfer...
Silvio Ghilardi, Enrica Nicolini, Daniele Zucchell...
JIFS
2007
82views more  JIFS 2007»
13 years 9 months ago
Anomaly detection in mobile communication networks using the self-organizing map
Anomaly detection is a pattern recognition task whose goal is to report the occurrence of abnormal or unknown behavior in a given system being monitored. In this paper we propose a...
Rewbenio A. Frota, Guilherme De A. Barreto, Jo&ati...
ENTCS
2002
91views more  ENTCS 2002»
13 years 8 months ago
Interval Duration Logic: Expressiveness and Decidability
We investigate a variant of dense-time Duration Calculus which permits model checking using timed/hybrid automata. We define a variant of the Duration Calculus, called Interval Du...
Paritosh K. Pandya
EOR
2002
125views more  EOR 2002»
13 years 8 months ago
Genetic local search for multi-objective combinatorial optimization
The paper presents a new genetic local search algorithm for multi-objective combinatorial optimization. The goal of the algorithm is to generate in a short time a set of approxima...
Andrzej Jaszkiewicz
AI
1998
Springer
13 years 8 months ago
Uncertainty Measures of Rough Set Prediction
The main statistics used in rough set data analysis, the approximation quality, is of limited value when there is a choice of competing models for predicting a decision variable. ...
Ivo Düntsch, Günther Gediga