2832 search results - page 405 / 567 » Flexible Modelling for Requirements Engineering |
218
Voted
FOIKS
2006
Springer
15 years 10 months ago
2006
Springer
It is claimed in [45] that first-order theorem provers are not efficient for reasoning with ontologies based on description logics compared to specialised description logic reasone...
250
click to vote
P2PKM
2004
15 years 8 months ago
2004
The ubiquitous computing vision is to make knowledge and services easily available in our everyday environments. A wide range of devices, applications and services can be intercon...
201
click to vote
TC
2010
15 years 5 months ago
2010
—The most pervasive compute operation carried out in almost all bioinformatics applications is pairwise sequence homology detection (or sequence alignment). Due to exponentially ...
194
click to vote
SMA
2003
ACM
16 years 7 days ago
2003
ACM
Associativity between feature models implies the automatic updating of different feature models of a part after changes are made in one of its feature models. This is an importan...
189
Voted
FOSSACS
2005
Springer
16 years 16 days ago
2005
Springer
Nominal calculi have been shown very effective to formally model a variety of computational phenomena. The models of nominal calculi have often infinite states, thus making model ...