Sciweavers

1559 search results - page 51 / 312
» Fundamentals of Generic Programming
Sort
View
CORR
2010
Springer
200views Education» more  CORR 2010»
14 years 9 months ago
Unified Compression-Based Acceleration of Edit-Distance Computation
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...
ITNG
2006
IEEE
15 years 3 months ago
Rethinking Programming
The accepted view of programming, rooted in Turing’s fundamental characterization of algorithms, has had a profound impact on the theory and practice of computing with yet broad...
W. M. Beynon, R. C. Boyatt, S. B. Russ
ICRA
1998
IEEE
87views Robotics» more  ICRA 1998»
15 years 1 months ago
Hybrid Control as a Method for Robot Motion Programming
This paper presents a class of fundamental control policies suitable for use in a novel method for designing and specifying the dynamic motion of robotic systems. Through recourse...
Alfred A. Rizzi
CSEE
2010
Springer
14 years 7 months ago
An Undergraduate Summer Research Program in Software Safety
This paper shares the experiences and lessons learned from conducting an NSF-sponsored eight-week summer research program for ten undergraduate students from multiple universities...
W. Eric Wong, Vidroha Debroy
HASKELL
2005
ACM
15 years 3 months ago
TypeCase: a design pattern for type-indexed functions
A type-indexed function is a function that is defined for each member of some family of types. Haskell’s type class mechanism provides collections of open type-indexed function...
Bruno C. D. S. Oliveira, Jeremy Gibbons