11345 search results - page 1764 / 2269 » Foundations of Computer Science |
146
click to vote
PPSC
1993
15 years 6 months ago
1993
The dense nonsymmetric eigenproblem is one of the hardest linear algebra problems to solvee ectively on massivelyparallel machines. Rather than trying to design a black box" ...
157
Voted
CSR
2008
Springer
15 years 5 months ago
2008
Springer
Constraint satisfaction problems have enjoyed much attention since the early seventies, and in the last decade have become also a focus of attention amongst theoreticians. Graph c...
166
click to vote
SIGCSE
2008
ACM
15 years 5 months ago
2008
ACM
Coercing new programmers to adopt disciplined development practices such as thorough unit testing is a challenging endeavor. Test-driven development (TDD) has been proposed as a s...
133
click to vote
SIGCSE
2008
ACM
15 years 5 months ago
2008
ACM
A Contributing Student Pedagogy (CSP) is a pedagogy that encourages students to contribute to the learning of others and to value the contributions of others. CSP in formal educat...
160
click to vote
IJMMS
2007
15 years 5 months ago
2007
: In information systems that support knowledge-discovery applications such as scientific exploration, reliance on highly structured ontologies as data-organization aids can be lim...