9997 search results - page 455 / 2000 » The case for crowd computing |
156
click to vote
PG
1997
IEEE
15 years 10 months ago
1997
IEEE
We discuss the theory and practical issues behind creating reflection models to show the difficulty of the problem. We survey the current approaches towards reflection models for ...
197
click to vote
STACS
1991
Springer
15 years 10 months ago
1991
Springer
Several relation-algebraic algorithms for computing the cut completion of a partially ordered set are formally developed and afterwards generalized to the case of concept lattices....
196
click to vote
CPAIOR
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. This paper proposes to use local search inside filtering algorithms of combinatorial structures for which achieving a desired level of consistency is too computationally ...
170
click to vote
COLING
1992
15 years 8 months ago
1992
The main problem arising from the use of complex constraints in Computational Linguists is due to the NP-hardness of checking whether a given set of constraints is satisfiable and...
178
click to vote
HPDC
2010
IEEE
15 years 8 months ago
2010
IEEE
DiscFinder is a scalable approach for identifying large-scale astronomical structures, such as galaxy clusters, in massive observation and simulation astrophysics datasets. It is ...