Sciweavers

492 search results - page 58 / 99
» Simplifying Probabilistic Programs Using Computer Algebra
Sort
View
FASE
2006
Springer
15 years 2 months ago
Trace-Based Memory Aliasing Across Program Versions
One of the major costs of software development is associated with testing and validation of successive versions of software systems. An important problem encountered in testing and...
Murali Krishna Ramanathan, Suresh Jagannathan, Ana...
EOR
2010
88views more  EOR 2010»
14 years 11 months ago
Mathematical programming approaches for generating p-efficient points
Abstract: Probabilistically constrained problems, in which the random variables are finitely distributed, are nonconvex in general and hard to solve. The p-efficiency concept has b...
Miguel A. Lejeune, Nilay Noyan
GECCO
2009
Springer
109views Optimization» more  GECCO 2009»
15 years 5 months ago
Canonical representation genetic programming
Search spaces sampled by the process of Genetic Programming often consist of programs which can represent a function in many different ways. Thus, when the space is examined it i...
John R. Woodward, Ruibin Bai
ISSAC
1995
Springer
155views Mathematics» more  ISSAC 1995»
15 years 2 months ago
On the Implementation of Dynamic Evaluation
Dynamic evaluation is a technique for producing multiple results according to a decision tree which evolves with program execution. Sometimes it is desired to produce results for ...
Peter A. Broadbery, T. Gómez-Díaz, S...
ENTCS
2006
142views more  ENTCS 2006»
14 years 11 months ago
The Rewriting Logic Semantics Project
Rewriting logic is a flexible and expressive logical framework that unifies algebraic denotational semantics and structural operational semantics (SOS) in a novel way, avoiding th...
José Meseguer, Grigore Rosu