5606 search results - page 188 / 1122 » Advances in Information Science |
169
click to vote
ACMSE
2006
ACM
16 years 1 months ago
2006
ACM
Although the satisfiability problem (SAT) is NP-complete, state-of-the-art solvers for SAT can solve instances that are considered to be very hard. Emerging applications demand t...
201
click to vote
CSR
2010
Springer
15 years 12 months ago
2010
Springer
Let πw denote the failure function of the Knuth-Morris-Pratt algorithm for a word w. In this paper we study the following problem: given an integer array A [1 . . n], is there a w...
172
click to vote
CCA
2000
Springer
15 years 11 months ago
2000
Springer
Computing the spectral decomposition of a normal matrix is among the most frequent tasks to numerical mathematics. A vast range of methods are employed to do so, but all of them su...
162
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...
161
click to vote
ACSE
1998
ACM
15 years 11 months ago
1998
ACM
This paper describes a joint project between Massey and Waikato Universities to investigate the potential of ATM in providing telepresence in distance education situations. In 199...