2905 search results - page 78 / 581 » Formal Memetic Algorithms |
CLIN
2004
13 years 10 months ago
2004
The Minimalist Program (Chomsky 1995
FAW
2008
Springer
13 years 10 months ago
2008
Springer
constraint bipartite vertex cover is a graph-theoretical formalization of the spare allocation problem for reconfigurable arrays. We report on an implementation of a parameterized ...
CORR
2008
Springer
13 years 9 months ago
2008
Springer
People usually regard algorithms as more abstract than the programs that implement them. The natural way to formalize this idea is that algorithms are equivalence classes of progra...
ZUM
2005
Springer
14 years 2 months ago
2005
Springer
In this paper we use Z to capture the requirements for an ‘intuitive’ menu navigation system as a series of conjectures that should hold. We use those requirements to investiga...
CONCUR
2003
Springer
14 years 2 months ago
2003
Springer
Abstract. We give a process calculus model that formalizes a wellknown algorithm (introduced by Chandra and Toueg) solving consensus in the presence of a particular class of failur...