Sciweavers

4940 search results - page 122 / 988
» On the Complexity of Universal Programs
Sort
View
ACE
2004
258views Education» more  ACE 2004»
15 years 6 months ago
Using a Maze Case Study to Teach Object-Oriented Programming and Design Patterns
In order to teach object-oriented design and programming in introductory computer science it is imperative to teach objects from the very beginning of the course. The use of inter...
Chris Nevison, Barbara Wells
146
Voted
MP
2007
95views more  MP 2007»
15 years 4 months ago
Smoothed analysis of integer programming
We present a probabilistic analysis of integer linear programs (ILPs). More specifically, we study ILPs in a so-called smoothed analysis in which it is assumed that first an adve...
Heiko Röglin, Berthold Vöcking
SIGPLAN
2008
15 years 4 months ago
Addressing the disconnect between the good and the popular
For several decades universities have taught programming languages as a fundamental part of their undergraduate curriculum. These courses cover the core topics used in the design ...
Michael Hind
KES
2008
Springer
15 years 4 months ago
Functional genetic programming and exhaustive program search with combinator expressions
Using a strongly typed functional programming language for genetic programming has many advantages, but evolving functional programs with variables requires complex genetic operat...
Forrest Briggs, Melissa O'Neill
126
Voted
ISSTA
2006
ACM
15 years 10 months ago
Using model checking with symbolic execution to verify parallel numerical programs
We present a method to verify the correctness of parallel programs that perform complex numerical computations, including computations involving floating-point arithmetic. The me...
Stephen F. Siegel, Anastasia Mironova, George S. A...