221 search results - page 6 / 45 » Analyzing the Implicit Computational Complexity of object-or... |
TCS
2011
13 years 2 months ago
2011
New, simple, proofs of soundness (every representable function lies in a given complexity class) for Elementary Affine Logic, LFPL and Soft Affine Logic are presented. The proofs ...
ORDER
2010
13 years 5 months ago
2010
Embedding a partially ordered set into a product of chains is a classical way to encode it. Such encodings have been used in various fields such as object oriented programming or ...
CEC
2008
IEEE
14 years 1 months ago
2008
IEEE
— Software evolution and update play a vital role in software engineering. It has many advantages, such as improving the efficiency of programming, reducing the cost of maintena...
FOGA
2011
12 years 10 months ago
2011
Analyzing the computational complexity of evolutionary algorithms (EAs) for binary search spaces has significantly informed our understanding of EAs in general. With this paper, ...
GECCO
2007
Springer
2007
Springer
Exploring medical data using visual spaces with genetic programming and implicit functional mappings
14 years 1 months ago
Two medical data sets (Breast cancer and Colon cancer) are investigated within a visual data mining paradigm through the unsupervised construction of virtual reality spaces using ...