Sciweavers

7576 search results - page 181 / 1516
» UNIX as an Application Program
Sort
View
COMPSAC
2009
IEEE
15 years 9 months ago
Towards a Theory for Testing Non-terminating Programs
Non-terminating programs are programs that legally perform unbounded computations. Though they are ubiquitous in real-world applications, testing these programs requires new theor...
Arnaud Gotlieb, Matthieu Petit
GECCO
2009
Springer
107views Optimization» more  GECCO 2009»
15 years 9 months ago
Evolving distributed algorithms with genetic programming: election
In this paper, we present a detailed analysis of the application of Genetic Programming to the evolution of distributed algorithms. This research field has many facets which make...
Thomas Weise, Michael Zapf
143
Voted
CIE
2010
Springer
15 years 2 months ago
Proofs, Programs, Processes
Abstract. We study a realisability interpretation for inductive and coinductive definitions and discuss its application to program extraction from proofs. A speciality of this inte...
Ulrich Berger, Monika Seisenberger
IJCNN
2008
IEEE
15 years 11 months ago
A quantum calculus formulation of dynamic programming and ordered derivatives
— Much recent research activity has focused on the theory and application of quantum calculus. This branch of mathematics continues to find new and useful applications and there ...
John Seiffertt, Donald C. Wunsch
112
Voted
CP
2005
Springer
15 years 10 months ago
Modeling Constraint Programs with Software Technology Standards
There is no unified modeling standard available to the CP community, so constraint programs can not be developed independently from the used CP library. Without such standard, CP ...
Matthias Hoche, Stefan Jähnichen