7123 search results - page 190 / 1425 » The Ordered Set of Rough Sets |
165
click to vote
STACS
1994
Springer
15 years 10 months ago
1994
Springer
The L ? = NL question remains one of the major unresolved problems in complexity theory. Both L and NL have logical characterizations as the sets of totally ordered ( ) structures...
182
click to vote
CP
2006
Springer
15 years 10 months ago
2006
Springer
Dynamic Backtracking (DBT) is a well known algorithm for solving Constraint Satisfaction Problems. In DBT, variables are allowed to keep their assignment during backjump, if they a...
157
click to vote
BMCBI
2008
15 years 6 months ago
2008
Background: Contact order is a topological descriptor that has been shown to be correlated with several interesting protein properties such as protein folding rates and protein tr...
177
click to vote
COCOON
2005
Springer
16 years 1 days ago
2005
Springer
Genomic maps often do not specify the order within some groups of two or more markers. The synthesis of a master map from several sources introduces additional order ambiguity due ...
199
click to vote
INFOVIS
2003
IEEE
15 years 11 months ago
2003
IEEE
Large numbers of dimensions not only cause clutter in multidimensional visualizations, but also make it difficult for users to navigate the data space. Effective dimension manage...