Sciweavers

7961 search results - page 273 / 1593
» Input-Output Model Programs
Sort
View
GECCO
1999
Springer
15 years 8 months ago
Challenges with Verification, Repeatability, and Meaningful Comparison in Genetic Programming: Gibson's Magic
This paper examines some of the reporting and research practices concerning empirical work in genetic programming. We describe several common loopholes and offer three case studie...
Jason M. Daida, Derrick S. Ampy, Michael Ratanasav...
FMCAD
2008
Springer
15 years 5 months ago
Scaling Up the Formal Verification of Lustre Programs with SMT-Based Techniques
We present a general approach for verifying safety properties of Lustre programs automatically. Key aspects of the approach are the choice of an expressive first-order logic in wh...
George Hagen, Cesare Tinelli
ICMLA
2007
15 years 5 months ago
Maximum Likelihood Quantization of Genomic Features Using Dynamic Programming
Dynamic programming is introduced to quantize a continuous random variable into a discrete random variable. Quantization is often useful before statistical analysis or reconstruct...
Mingzhou (Joe) Song, Robert M. Haralick, Sté...
IWFM
2003
123views Formal Methods» more  IWFM 2003»
15 years 5 months ago
Derivation of Distributed Programs in the Theory of Owicki and Gries: An Example
This paper describes the derivation of a program for the propagation of information over a network, with acknowledgement (feedback) when the computation is complete. The derivatio...
Doug Goldson
JLP
2002
90views more  JLP 2002»
15 years 3 months ago
Combining programs and state machines
State machines consume and process actions complementary to programs issuing actions. State machines maintain a state and reply with a boolean response to each action in their int...
Jan A. Bergstra, Alban Ponse