4074 search results - page 489 / 815 » Abstract Graph Transformation |
172
click to vote
ECAI
2000
Springer
15 years 11 months ago
2000
Springer
Abstract. We describe an approach for compiling dynamic preferences into logic programs under the answer set semantics. An ordered logic program is an extended logic program in whi...
192
click to vote
ICCAD
1998
IEEE
15 years 11 months ago
1998
IEEE
Abstract Althoughtremendousadvanceshave been accomplished in logic synthesis in the past two decades, in some cases logic synthesis still cannot attain the improvements possible by...
187
click to vote
EUROCRYPT
1998
Springer
15 years 11 months ago
1998
Springer
Abstract. Provable security is a very nice property for cryptographic protocols. Unfortunately, in many cases, this is at the cost of a considerable loss in terms of efficiency. Mo...
199
click to vote
DAC
1997
ACM
15 years 11 months ago
1997
ACM
The design process for xed-point implementations either in software or in hardware requires a bit-true speci cation of the algorithm in order to analyze quantization e ects on an...
172
click to vote
PEPM
1994
ACM
15 years 11 months ago
1994
ACM
Abstract. Selective eta-expansion is a powerful "binding-time improvement", i.e., a sourceprogram modification that makes a partial evaluator yield better results. But li...