3793 search results - page 622 / 759 » Expressive Description Logics |
157
click to vote
CONSTRAINTS
2007
15 years 6 months ago
2007
When a new (global) constraint is introduced in local search, measures for the penalty and variable conflicts of that constraint must be defined, and incremental algorithms for m...
144
click to vote
JODS
2008
15 years 6 months ago
2008
The ability to deal with inconsistencies and to evaluate the impact of possible solutions for resolving inconsistencies are of the utmost importance in real world ontology applicat...
190
Voted
DKE
2007
15 years 6 months ago
2007
ct 9 The benefits of modular representations are well known from many areas of computer science. While in software engi10 neering modularization is mainly a vehicle for supporting...
176
click to vote
TC
2008
15 years 6 months ago
2008
Since redundant number systems allow for constant time addition, they are often at the heart of modular multipliers designed for public key cryptography (PKC) applications. Indeed,...
170
click to vote
SIAMCOMP
2000
15 years 6 months ago
2000
Abstract. We consider two natural generalizations of the notion of transversal to a finite hypergraph, arising in data-mining and machine learning, the so called multiple and parti...