11397 search results - page 283 / 2280 » A Relational Abstraction for Functions |
197
click to vote
TPHOL
2009
IEEE
16 years 2 months ago
2009
IEEE
Abstract. FinFuns are total functions that are constant except for a finite set of points, i.e. a generalisation of finite maps. We formalise them in Isabelle/HOL and present how...
167
click to vote
ALDT
2009
Springer
16 years 2 months ago
2009
Springer
Abstract. Several schemes have been proposed for compactly representing multiattribute utility functions, yet none seems to achieve the level of success achieved by Bayesian and Ma...
230
click to vote
LION
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. Protein function prediction represents a fundamental challenge in bioinformatics. The increasing availability of proteomics network data has enabled the development of se...
184
click to vote
KI
2007
Springer
16 years 1 months ago
2007
Springer
Abstract. We compare three systems for the task of synthesising functional recursive programs, namely Adate, an approach through evolutionary computation, the classification learn...
224
click to vote
AES
2004
Springer
16 years 23 days ago
2004
Springer
Abstract. While it is known previously that the cycle lengths of individual components of the AES round function are very small, we demonstrate here that the cycle length of the S-...