Sciweavers

1291 search results - page 105 / 259
» Arithmetic program paths
Sort
View
ENTCS
2010
90views more  ENTCS 2010»
13 years 10 months ago
Recursive Program Schemes and Context-Free Monads
Solutions of recursive program schemes over a given signature were characterized by Bruno Courcelle as precisely the context-free (or algebraic) -trees. These are the finite and ...
Jirí Adámek, Stefan Milius, Jiri Vel...
GECCO
2008
Springer
143views Optimization» more  GECCO 2008»
13 years 11 months ago
Enhanced generalized ant programming (EGAP)
This paper begins by reviewing different methods of automatic programming while emphasizing the technique of Ant Programming (AP). AP uses an ant foraging metaphor in which ants g...
Amirali Salehi-Abari, Tony White
ICPP
1996
IEEE
14 years 2 months ago
Portable Parallel Programming Languages
In this workshop session, three speakers present their viewpoints and contributions to the topic of portable parallel programming languages. They are Dennis Gannon from Indiana Un...
Rudolf Eigenmann
COMPSAC
2005
IEEE
14 years 3 months ago
Goal-Oriented Test Data Generation for Programs with Pointer Variables
Automatic test data generation leads to the identification of input values on which a selected path or a selected branch is executed within a program (path-oriented vs goalorient...
Arnaud Gotlieb, Tristan Denmat, Bernard Botella
WSC
2008
14 years 7 days ago
Mathematical programming representations for state-dependent queues
Discrete-event dynamic systems with feedback, where the behavior of the system depends on the system state, are difficult to model due to the uncertainties and dependencies of sys...
Wai Kin Chan, Lee W. Schruben