Sciweavers

4488 search results - page 232 / 898
» Properties of NP-Complete Sets
Sort
View
ICDCIT
2005
Springer
16 years 6 days ago
FlexiRank: An Algorithm Offering Flexibility and Accuracy for Ranking the Web Pages
The existing search engines sometimes give unsatisfactory search result for lack of any categorization. If there is some means to know the preference of user about the search resul...
Debajyoti Mukhopadhyay, Pradipta Biswas
IFM
2005
Springer
16 years 6 days ago
A Fixpoint Semantics of Event Systems With and Without Fairness Assumptions
Abstract. We present a fixpoint semantics of event systems. The semantics is presented in a general framework without concerns of fairness. Soundness and completeness of rules for...
Héctor Ruíz Barradas, Didier Bert
163
Voted
UML
2005
Springer
16 years 5 days ago
An Ontology-Based Approach for Evaluating the Domain Appropriateness and Comprehensibility Appropriateness of Modeling Languages
In this paper we present a framework for the evaluation and (re)design of modeling languages. We focus here on the evaluation of the suitability of a language to model a set or rea...
Giancarlo Guizzardi, Luís Ferreira Pires, M...
255
Voted
FAABS
2004
Springer
16 years 2 days ago
Towards Timed Automata and Multi-agent Systems
Abstract. The design of reactive systems must comply with logical correctness (the system does what it is supposed to do) and timeliness (the system has to satisfy a set of tempora...
Guillaume Hutzler, Hanna Klaudel, D. Yue Wang
FORMATS
2004
Springer
16 years 2 days ago
Symbolic Model Checking for Probabilistic Timed Automata
Probabilistic timed automata are timed automata extended with discrete probability distributions, and can be used to model timed randomised protocols or faulttolerant systems. We ...
Marta Z. Kwiatkowska, Gethin Norman, Jeremy Sprost...