Sciweavers

2076 search results - page 74 / 416
» Functional logic overloading
Sort
View
BIRTHDAY
2007
Springer
14 years 3 months ago
Linear Recursive Functions
Abstract. With the recent trend of analysing the process of computation through the linear logic looking glass, it is well understood that the ability to copy and erase data is ess...
Sandra Alves, Maribel Fernández, Már...
ISIPTA
2003
IEEE
14 years 2 months ago
Combining Belief Functions Issued from Dependent Sources
Dempsterā€™s rule for combining two belief functions assumes the independence of the sources of information. If this assumption is questionable, I suggest to use the least speciļ¬...
Marco E. G. V. Cattaneo
AMAST
2000
Springer
14 years 1 months ago
Distance Functions for Defaults in Reactive Systems
Default reasoning has become an important topic in software engineering. In particular, defaults can be used to revise speci cations, to enhance reusability of existing systems, an...
Sofia Guerra
CDES
2008
87views Hardware» more  CDES 2008»
13 years 10 months ago
Finding Minimal ESCT Expressions for Boolean Functions with Weight of up to 7
In this paper an algorithm is proposed for the synthesis and exact minimization of ESCT (Exclusive or Sum of Complex Terms) expressions for Boolean functions of up to seven comple...
Dimitrios Voudouris, Marinos Sampson, George K. Pa...
INTEGRATION
2008
89views more  INTEGRATION 2008»
13 years 8 months ago
Exact ESCT minimization for functions of up to six input variables
In this paper an efficient algorithm for the synthesis and exact minimization of ESCT(Exclusive or Sum of Complex Terms) expressions for Boolean functions of at most six variables...
Dimitrios Voudouris, Marinos Sampson, George K. Pa...