Sciweavers

3663 search results - page 229 / 733
» Problems in the ontology of computer programs
Sort
View
EC
1998
112views ECommerce» more  EC 1998»
15 years 6 months ago
DNA Computation: Theory, Practice, and Prospects
L. M. Adleman launched the field of DNA computing with a demonstration in 1994 that strands of DNA could be used to solve the Hamiltonian path problem for a simple graph. He also...
Carlo C. Maley
BIRTHDAY
2010
Springer
15 years 7 months ago
Choiceless Computation and Symmetry
Many natural problems in computer science concern structures like graphs where elements are not inherently ordered. In contrast, Turing machines and other common models of computa...
Benjamin Rossman
ICIP
2001
IEEE
16 years 8 months ago
Easy Java programming for teaching image-processing
We have designed a series of computer sessions build around ImageJ (a public-domain software for image analysis), as a practical complement to a two-semester course in image proce...
Daniel Sage, Michael Unser
FOSSACS
2009
Springer
16 years 1 months ago
Realizability of Concurrent Recursive Programs
Abstract. We define and study an automata model of concurrent recursive programs. An automaton consists of a finite number of pushdown systems running in parallel and communicati...
Benedikt Bollig, Manuela-Lidia Grindei, Peter Habe...
GECCO
2006
Springer
202views Optimization» more  GECCO 2006»
15 years 10 months ago
Evolving hash functions by means of genetic programming
The design of hash functions by means of evolutionary computation is a relatively new and unexplored problem. In this work, we use Genetic Programming (GP) to evolve robust and fa...
César Estébanez, Julio César ...