Sciweavers

706 search results - page 94 / 142
» Super Solutions in Constraint Programming
Sort
View
ESOP
2009
Springer
15 years 3 months ago
An Efficient Algorithm for Solving the Dyck-CFL Reachability Problem on Trees
The context-free language (CFL) reachability problem is well known and studied in computer science, as a fundamental problem underlying many important static analyses such as point...
Hao Yuan, Patrick Th. Eugster
SC
1995
ACM
15 years 3 months ago
A Novel Approach Towards Automatic Data Distribution
: Data distribution is one of the key aspects that a parallelizing compiler for a distributed memory architecture should consider, in order to get efficiency from the system. The ...
Jordi Garcia, Eduard Ayguadé, Jesús ...
CCE
2004
14 years 11 months ago
Continuous reformulations of discrete-continuous optimization problems
This paper treats the solution of nonlinear optimization problems involving discrete decision variables, also known as generalized disjunctive programming (GDP) or mixed-integer n...
Oliver Stein, Jan Oldenburg, Wolfgang Marquardt
ICCAD
2006
IEEE
110views Hardware» more  ICCAD 2006»
15 years 8 months ago
Voltage island aware floorplanning for power and timing optimization
Power consumption is a crucial concern in nanometer chip design. Researchers have shown that multiple supply voltage (MSV) is an effective method for power consumption reduction....
Wan-Ping Lee, Hung-Yi Liu, Yao-Wen Chang
ESOP
2007
Springer
15 years 6 months ago
Interprocedurally Analysing Linear Inequality Relations
In this paper we present an alternative approach to interprocedurally g linear inequality relations. We propose an abstraction of the effects of procedures through convex sets of t...
Helmut Seidl, Andrea Flexeder, Michael Petter