Sciweavers

2989 search results - page 53 / 598
» Using Domain-Independent Problems for Introducing Formal Met...
Sort
View
ENTCS
2008
79views more  ENTCS 2008»
14 years 9 months ago
The Compositional Method and Regular Reachability
The compositional method, introduced by Feferman and Vaught in 1959, allows to reduce the model-checking problem for a product structure to the model-checking problem for its fact...
Ingo Felscher
ICAC
2007
IEEE
15 years 4 months ago
Adaptive Multi-levels Dictionaries and Singular Value Decomposition Techniques for Autonomic Problem Determination
An autonomic problem determination system can adapt to changing environments, react to existing or new error condition and predict possible problems. In this report, we propose su...
Hoi Chan, Thomas Kwok
AAAI
2012
13 years 3 days ago
The Price of Neutrality for the Ranked Pairs Method
The complexity of the winner determination problem has been studied for almost all common voting rules. A notable exception, possibly caused by some confusion regarding its exact ...
Markus Brill, Felix A. Fischer
HICSS
2008
IEEE
130views Biometrics» more  HICSS 2008»
15 years 4 months ago
Enterprise Modeling for Information System Development within MDA
Object-oriented analysis suggests semiformal usecase driven techniques for problem domain modeling from a computation independent viewpoint. The proposed approach called Topologic...
Janis Osis, Erika Asnina
IFM
2009
Springer
158views Formal Methods» more  IFM 2009»
15 years 4 months ago
Developing Topology Discovery in Event-B
Abstract. We present a formal development in Event-B of a distributed topology discovery algorithm. Distributed topology discovery is at the core of several routing algorithms and ...
Thai Son Hoang, Hironobu Kuruma, David A. Basin, J...