Sciweavers

595 search results - page 89 / 119
» Using Constraints with Memory to Implement Variable Eliminat...
Sort
View
DAC
1995
ACM
14 years 2 days ago
A Transformation-Based Approach for Storage Optimization
High-level synthesis (HLS) has been successfully targeted towards the digital signal processing (DSP) domain. Both application-speci c integrated circuits (ASICs) and application-...
Wei-Kai Cheng, Youn-Long Lin
COR
2010
123views more  COR 2010»
13 years 8 months ago
Decomposition, reformulation, and diving in university course timetabling
In many real-life optimisation problems, there are multiple interacting components in a solution. For example, different components might specify assignments to different kinds of...
Edmund K. Burke, Jakub Marecek, Andrew J. Parkes, ...
TCS
2008
13 years 8 months ago
Reconstruction of convex lattice sets from tomographic projections in quartic time
Filling operations are procedures which are used in Discrete Tomography for the reconstruction of lattice sets having some convexity constraints. Many algorithms have been publish...
Sara Brunetti, Alain Daurat
SAS
2004
Springer
14 years 1 months ago
The Octahedron Abstract Domain
hedron Abstract Domain Robert Claris´o and Jordi Cortadella Universitat Polit`ecnica de Catalunya Barcelona, Spain Abstract. An interesting area in static analysis is the study of...
Robert Clarisó, Jordi Cortadella
SODA
1998
ACM
114views Algorithms» more  SODA 1998»
13 years 9 months ago
Exact Arithmetic at Low Cost - A Case Study in Linear Programming
We describe a new exact-arithmetic approach to linear programming when the number of variables n is much larger than the number of constraints m (or vice versa). The algorithm is ...
Bernd Gärtner