Sciweavers

4513 search results - page 737 / 903
» Logic programming with satisfiability
Sort
View
146
Voted
ASAP
2008
IEEE
199views Hardware» more  ASAP 2008»
15 years 5 months ago
An efficient method for evaluating polynomial and rational function approximations
In this paper we extend the domain of applicability of the E-method [7, 8], as a hardware-oriented method for evaluating elementary functions using polynomial and rational functio...
Nicolas Brisebarre, Sylvain Chevillard, Milos D. E...
ASIACRYPT
2008
Springer
15 years 5 months ago
Sufficient Conditions for Intractability over Black-Box Groups: Generic Lower Bounds for Generalized DL and DH Problems
Abstract. The generic (aka. black-box) group model is a valuable methodology for analyzing the computational hardness of number-theoretic problems used in cryptography. Since the p...
Andy Rupp, Gregor Leander, Endre Bangerter, Alexan...
136
Voted
ASPDAC
2008
ACM
69views Hardware» more  ASPDAC 2008»
15 years 5 months ago
Fast, quasi-optimal, and pipelined instruction-set extensions
Nowadays many customised embedded processors offer the possibility of speeding up an application by implementing it using Application-Specific Functional units (AFUs). However, th...
Ajay K. Verma, Philip Brisk, Paolo Ienne
138
Voted
CONEXT
2008
ACM
15 years 5 months ago
On cooperative settlement between content, transit and eyeball internet service providers
Internet service providers (ISPs) depend on one another to provide global network services. However, the profit-seeking nature of the ISPs leads to selfish behaviors that result i...
Richard T. B. Ma, Dah-Ming Chiu, John C. S. Lui, V...
144
Voted
ECAI
2008
Springer
15 years 5 months ago
Optimizing Causal Link Based Web Service Composition
Automation of Web service composition is one of the most interesting challenges facing the Semantic Web today. Since Web services have been enhanced with formal semantic descriptio...
Freddy Lécué, Alexandre Delteil, Ala...