Sciweavers

1989 search results - page 248 / 398
» Set functions for functional logic programming
Sort
View
COCOA
2007
Springer
16 years 16 days ago
On Threshold BDDs and the Optimal Variable Ordering Problem
Abstract. Many combinatorial optimization problems can be formulated as 0/1 integer programs (0/1 IPs). The investigation of the structure of these problems raises the following ta...
Markus Behle
ISQED
2005
IEEE
125views Hardware» more  ISQED 2005»
15 years 12 months ago
A New Method for Design of Robust Digital Circuits
As technology continues to scale beyond 100nm, there is a significant increase in performance uncertainty of CMOS logic due to process and environmental variations. Traditional c...
Dinesh Patil, Sunghee Yun, Seung-Jean Kim, Alvin C...
GECCO
2006
Springer
206views Optimization» more  GECCO 2006»
15 years 10 months ago
A dynamically constrained genetic algorithm for hardware-software partitioning
In this article, we describe the application of an enhanced genetic algorithm to the problem of hardware-software codesign. Starting from a source code written in a high-level lan...
Pierre-André Mudry, Guillaume Zufferey, Gia...
DAC
2005
ACM
15 years 8 months ago
VLIW: a case study of parallelism verification
Parallelism in processor architecture and design imposes a verification challenge as the exponential growth in the number of execution combinations becomes unwieldy. In this paper...
Allon Adir, Yaron Arbetman, Bella Dubrov, Yossi Li...
ICALP
2010
Springer
15 years 11 months ago
On the Expressiveness of Polyadic and Synchronous Communication in Higher-Order Process Calculi
Higher-order process calculi are calculi in which processes can be communicated. We study the expressiveness of strictly higher-order process calculi, and focus on two issues well-...
Ivan Lanese, Jorge A. Pérez, Davide Sangior...