Sciweavers

5090 search results - page 329 / 1018
» Constructing Strategies for Programming
Sort
View
PLDI
2009
ACM
15 years 12 months ago
Binary analysis for measurement and attribution of program performance
Modern programs frequently employ sophisticated modular designs. As a result, performance problems cannot be identified from costs attributed to routines in isolation; understand...
Nathan R. Tallent, John M. Mellor-Crummey, Michael...
UPP
2004
Springer
15 years 10 months ago
Inverse Design of Cellular Automata by Genetic Algorithms: An Unconventional Programming Paradigm
Evolving solutions rather than computing them certainly represents an unconventional programming approach. The general methodology of evolutionary computation has already been know...
Thomas Bäck, Ron Breukelaar, Lars Willmes
ICFP
2005
ACM
16 years 5 months ago
Monadic augment and generalised short cut fusion
Monads are commonplace programming devices that are used to uniformly structure computations with effects such as state, exceptions, and I/O. This paper further develops the monad...
Neil Ghani, Patricia Johann, Tarmo Uustalu, Varmo ...
POPL
2012
ACM
14 years 19 days ago
Resource-sensitive synchronization inference by abduction
We present an analysis which takes as its input a sequential program, augmented with annotations indicating potential parallelization opportunities, and a sequential proof, writte...
Matko Botincan, Mike Dodds, Suresh Jagannathan
BIRTHDAY
2005
Springer
15 years 10 months ago
Planning in Answer Set Programming using Ordered Task Decomposition
abstract. In this paper we investigate a formalism for solving planning problems based on ordered task decomposition using Answer Set Programming (ASP). Our planning methodology is...
Jürgen Dix, Ugur Kuter, Dana S. Nau