Sciweavers

3663 search results - page 144 / 733
» Problems in the ontology of computer programs
Sort
View
AAAI
2007
15 years 10 days ago
Anytime Coordination Using Separable Bilinear Programs
Developing scalable coordination algorithms for multi-agent systems is a hard computational challenge. One useful approach, demonstrated by the Coverage Set Algorithm (CSA), explo...
Marek Petrik, Shlomo Zilberstein
FECS
2006
100views Education» more  FECS 2006»
14 years 11 months ago
Pair Programming: Not for Everyone?
- Developments in CS1 pedagogy seek to improve the capabilities of students in their understanding of how to write programs. This involves learning how to solve various types of pr...
Jacob P. Somervell
STACS
2009
Springer
15 years 4 months ago
A Unified Algorithm for Accelerating Edit-Distance Computation via Text-Compression
The edit distance problem is a classical fundamental problem in computer science in general, and in combinatorial pattern matching in particular. The standard dynamic-programming s...
Danny Hermelin, Gad M. Landau, Shir Landau, Oren W...
BMCBI
2010
175views more  BMCBI 2010»
14 years 10 months ago
Towards high performance computing for molecular structure prediction using IBM Cell Broadband Engine - an implementation perspe
Background: RNA structure prediction problem is a computationally complex task, especially with pseudo-knots. The problem is well-studied in existing literature and predominantly ...
S. P. T. Krishnan, Sim Sze Liang, Bharadwaj Veerav...
SIGCSE
2010
ACM
121views Education» more  SIGCSE 2010»
15 years 4 months ago
Using strategies for assessment of programming exercises
Programming exercise assessment tools alleviate the task of teachers, and increase consistency of markings. Many programming exercise assessment tools are based on testing. A test...
Alex Gerdes, Johan Jeuring, Bastiaan Heeren