5964 search results - page 819 / 1193 » A theory of speculative computation |
199
click to vote
DALT
2005
Springer
16 years 1 months ago
2005
Springer
Agents need to be able to change their beliefs; in particular, they should be able to contract or remove a certain belief in order to restore consistency to their set of beliefs, a...
189
click to vote
FOSSACS
2005
Springer
16 years 1 months ago
2005
Springer
The idea of composition and decomposition to obtain computability results is particularly relevant for true-concurrency. In contrast to the interleaving world, where composition an...
203
click to vote
GECCO
2005
Springer
16 years 1 months ago
2005
Springer
This paper offers a novel approach to coevolution based on the sociological theory of symbolic interactionism. It provides a multi-agent computational model along with experimenta...
178
click to vote
GECCO
2005
Springer
16 years 1 months ago
2005
Springer
This paper presents a kernel density estimation method by means of real-coded crossovers. Estimation of density algorithms (EDAs) are evolutionary optimization techniques, which d...
174
click to vote
ICALP
2005
Springer
16 years 1 months ago
2005
Springer
We consider the problem of efficiently designing sets (codes) of equal-length DNA strings (words) that satisfy certain combinatorial constraints. This problem has numerous motivati...