1989 search results - page 248 / 398 » Set functions for functional logic programming |
144
Voted
COCOA
2007
Springer
15 years 9 months ago
2007
Springer
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...
148
click to vote
ISQED
2005
IEEE
15 years 9 months ago
2005
IEEE
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...
110
Voted
GECCO
2006
Springer
15 years 7 months ago
2006
Springer
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...
121
Voted
DAC
2005
ACM
15 years 5 months ago
2005
ACM
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...
126
click to vote
ICALP
2010
Springer
15 years 8 months ago
2010
Springer
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-...