454 search results - page 82 / 91 » Representation results for defeasible logic |
CC
2010
Springer
13 years 8 months ago
2010
Springer
Abstract. We prove lower bounds on the randomized two-party communication complexity of functions that arise from read-once boolean formulae. A read-once boolean formula is a formu...
ICFEM
2009
Springer
13 years 7 months ago
2009
Springer
Abstract. Certificate translation is a method that transforms certificates of source programs into certificates of their compilation. It provides strong guarantees on low-level cod...
TCIAIG
2010
13 years 4 months ago
2010
Abstract--Fingerprinting operators generate functional signatures of game players and are useful for their automated analysis independent of representation or encoding. The theory ...
SIGMOD
2008
ACM
14 years 10 months ago
2008
ACM
Schema integration is the problem of creating a unified target schema based on a set of existing source schemas that relate to each other via specified correspondences. The unifie...
DATE
2006
IEEE
14 years 3 months ago
2006
IEEE
Abstract— Continuing scaling of CMOS technology has allowed aggressive pursuant of increased clock rate in DSM chips. The ever shorter clock period has made switching times of di...