Sciweavers

1686 search results - page 32 / 338
» Programs as polygraphs: computability and complexity
Sort
View
SOFTWARE
2011
14 years 4 months ago
Object-Oriented Parallelisation of Java Desktop Programs
Developing parallel applications is notoriously difficult, but is even more complex for desktop applications. The added difficulties are primarily because of their interactive nat...
Nasser Giacaman, Oliver Sinnen
ACE
2004
258views Education» more  ACE 2004»
14 years 11 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
ASE
1998
81views more  ASE 1998»
14 years 9 months ago
Program Understanding as Constraint Satisfaction: Representation and Reasoning Techniques
The process of understanding a source code in a high-level programming language involves complex computation. Given a piece of legacy code and a library of program plan templates, ...
Steven G. Woods, Qiang Yang
SAC
2008
ACM
14 years 9 months ago
Preserving coordination properties when transforming concurrent system components
Complexity in concurrent or distributed systems can be managed by dividing component into smaller components. However, such transformations change the coordination behaviour betwe...
Gudmund Grov, Robert F. Pointon, Greg Michaelson, ...
95
Voted
CEC
2010
IEEE
14 years 1 months ago
Tweaking a tower of blocks leads to a TMBL: Pursuing long term fitness growth in program evolution
— If a population of programs evolved not for a few hundred generations but for a few hundred thousand or more, could it generate more interesting behaviours and tackle more comp...
Tony E. Lewis, George D. Magoulas