2131 search results - page 176 / 427 » Immunity for Closed Sets |
180
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
PGA (ProGram Algebra) is an algebra of programs which concerns programs in their simplest form: sequences of instructions. Molecular dynamics is a simple model of computation deve...
177
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
This paper presents a novel methodology to develop scheduling algorithms. The scheduling problem is phrased as a control problem, and control-theoretical techniques are used to de...
142
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
Since the inception of genetic algorithmics the identification of computational efficiencies of the simple genetic algorithm (SGA) has been an important goal. In this paper we dist...
173
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
Abstract. We generalize some of the central results in automata theory to the abstraction level of coalgebras and thus lay out the foundations of a universal theory of automata ope...
166
click to vote
DCG
2008
15 years 6 months ago
2008
We present a novel reconstruction algorithm that, given an input point set sampled from an object S, builds a one-parameter family of complexes that approximate S at different sca...