8196 search results - page 444 / 1640 » Computational Modeling and Complexity Science |
200
click to vote
CSR
2010
Springer
15 years 11 months ago
2010
Springer
Abstract. In this survey we compare the similarities, differences and the complexities of two very different approaches to solve a general constraint satisfaction probblems (CSP). ...
186
click to vote
DIS
2001
Springer
15 years 11 months ago
2001
Springer
Rapid growth of digital data collections is overwhelming the capabilities of humans to comprehend them without aid. The extraction of useful data from large raw data sets is someth...
215
click to vote
RANDOM
2001
Springer
15 years 11 months ago
2001
Springer
We consider the problem of determining whether a given function ¢ £ ¤¥ ¦ §¨© ¤¥ ¦ §¨ belongs to a certain class of Boolean functions or whether it is far from the...
182
click to vote
FOCS
2000
IEEE
15 years 11 months ago
2000
IEEE
We show that the graph isomorphism problem is hard under DLOGTIME uniform AC0 many-one reductions for the complexity classes NL, PL (probabilistic logarithmic space) for every loga...
150
click to vote
ITICSE
1999
ACM
15 years 11 months ago
1999
ACM
We present our work on building interactive continuous visualisations of distributed algorithms for educational purposes. The animations are comprised by a set of visualisation wi...