Sciweavers

1452 search results - page 91 / 291
» Algorithmic Analysis of Array-Accessing Programs
Sort
View
84
Voted
EUROGP
2005
Springer
107views Optimization» more  EUROGP 2005»
15 years 6 months ago
Operator-Based Distance for Genetic Programming: Subtree Crossover Distance
Abstract. This paper explores distance measures based on genetic operators for genetic programming using tree structures. The consistency between genetic operators and distance mea...
Steven M. Gustafson, Leonardo Vanneschi
111
Voted
IJISTA
2007
119views more  IJISTA 2007»
15 years 9 days ago
Online modelling based on Genetic Programming
: Genetic Programming (GP), a heuristic optimisation technique based on the theory of Genetic Algorithms (GAs), is a method successfully used to identify non-linear model structure...
Stephan M. Winkler, Hajrudin Efendic, Luigi del Re...
AOSD
2008
ACM
15 years 2 months ago
AJANA: a general framework for source-code-level interprocedural dataflow analysis of AspectJ software
Aspect-oriented software presents new challenges for the designers of static analyses. Our work aims to establish systematic foundations for dataflow analysis of AspectJ software....
Guoqing Xu, Atanas Rountev
SIGPLAN
2002
15 years 20 hour ago
Write barrier removal by static analysis
We present a new analysis for removing unnecessary write barriers in programs that use generational garbage collection. To our knowledge, this is the first static program analysis...
Karen Zee, Martin C. Rinard
OPODIS
2003
15 years 1 months ago
Detecting Temporal Logic Predicates in Distributed Programs Using Computation Slicing
Detecting whether a finite execution trace (or a computation) of a distributed program satisfies a given predicate, called predicate detection, is a fundamental problem in distr...
Alper Sen, Vijay K. Garg