Sciweavers

412 search results - page 5 / 83
» Completion for Multiple Reduction Orderings
Sort
View
ISQED
2006
IEEE
147views Hardware» more  ISQED 2006»
14 years 1 months ago
Compact Reduced Order Modeling for Multiple-Port Interconnects
— In this paper, we propose an efficient model order reduction (MOR) algorithm, called MTermMOR, for modeling interconnect circuits with large number of external ports. The prop...
Pu Liu, Sheldon X.-D. Tan, Bruce McGaughy, Lifeng ...
ICLP
2004
Springer
14 years 22 days ago
On Programs with Linearly Ordered Multiple Preferences
The extended answer set semantics for logic programs allows for the defeat of rules to resolve contradictions. We propose a refinement of these semantics based on a preference rel...
Davy Van Nieuwenborgh, Stijn Heymans, Dirk Vermeir
ASAP
2004
IEEE
160views Hardware» more  ASAP 2004»
13 years 11 months ago
Architectural Support for Arithmetic in Optimal Extension Fields
Public-key cryptosystems generally involve computation-intensive arithmetic operations, making them impractical for software implementation on constrained devices such as smart ca...
Johann Großschädl, Sandeep S. Kumar, Ch...
JAIR
2007
141views more  JAIR 2007»
13 years 7 months ago
Bin Completion Algorithms for Multicontainer Packing, Knapsack, and Covering Problems
Many combinatorial optimization problems such as the bin packing and multiple knapsack problems involve assigning a set of discrete objects to multiple containers. These problems ...
Alex S. Fukunaga, Richard E. Korf
ENTCS
2008
146views more  ENTCS 2008»
13 years 7 months ago
Complete Laziness: a Natural Semantics
Lazy evaluation (or call-by-need) is widely used and well understood, partly thanks to a clear operational semantics given by Launchbury. However, modern non-strict functional lan...
François-Régis Sinot