4134 search results - page 514 / 827 » Collaborative Practice Research |
130
click to vote
CP
2005
Springer
15 years 10 months ago
2005
Springer
Many problems of theoretical and practical interest can be formulated as Constraint Satisfaction Problems (CSPs). The general CSP is known to be NP-complete; however, distributed m...
135
click to vote
CP
2005
Springer
15 years 10 months ago
2005
Springer
We introduce a novel and exciting research area: symmetrising levels of consistency to produce stronger forms of consistency and more efficient mechanisms for establishing them. W...
139
click to vote
CSCLP
2005
Springer
15 years 10 months ago
2005
Springer
CSP search algorithms are exponential in the worst-case. A trivial upper bound on the time complexity of CSP search algorithms is O∗ (dn ), where n and d are the number of variab...
119
click to vote
EUROPKI
2005
Springer
15 years 10 months ago
2005
Springer
An enterprise (such as an institute of higher education) wishing to deploy PKI must choose between several options, all expensive and awkward. It might outsource certification to ...
128
Voted
ISNN
2005
Springer
15 years 10 months ago
2005
Springer
It is important in bioinformatics research and applications to select or discover informative genes of a tumor from microarray data. However, most of the existing methods are based...