921 search results - page 18 / 185 » Expressing Computational Complexity in Constructive Type The... |
STOC
2010
ACM
14 years 18 days ago
2010
ACM
We propose a new framework for discussing computational complexity of problems involving uncountably many objects, such as real numbers, sets and functions, that can be represente...
GECCO
2005
Springer
14 years 1 months ago
2005
Springer
We have investigated the potential for using genetic programming to evolve compiler parsing and translation routines for processing arithmetic and logical expressions as they are ...
ICCS
2004
Springer
14 years 1 months ago
2004
Springer
An important part of the computer science is focused on the links that can be established between group theory and graph theory. Cayley graphs can establish such a link but meet so...
ISSAC
2005
Springer
14 years 1 months ago
2005
Springer
This paper describes a method to use compiled, strongly typed Aldor domains in the interpreted, expression-oriented Maple environment. This represents a non-traditional approach t...
FOSSACS
2010
Springer
14 years 2 months ago
2010
Springer
For many application-level distributed protocols and parallel algorithms, the set of participants, the number of messages or the interaction structure are only known at run-time. T...