Sciweavers

2974 search results - page 307 / 595
» Model-Driven Constraint Programming
Sort
View
DAC
1997
ACM
15 years 10 months ago
An Improved Algorithm for Minimum-Area Retiming
The concept of improving the timing behavior of a circuit by relocating flip-flops is called retiming and was first presented by Leiserson and Saxe. The ASTRA algorithm propose...
Naresh Maheshwari, Sachin S. Sapatnekar
CVPR
2010
IEEE
15 years 9 months ago
Co-clustering of Image Segments Using Convex Optimization Applied to EM Neuronal Reconstruction
This paper addresses the problem of jointly clustering two segmentations of closely correlated images. We focus in particular on the application of reconstructing neuronal structu...
Shiv Vitaladevuni, Ronen Basri
COCOA
2008
Springer
15 years 8 months ago
Efficient Method for Periodic Task Scheduling with Storage Requirement Minimization
Abstract. In this paper, we study an efficient approximate integer linear programming formulation of the general problem of one-dimensional periodic task scheduling under storage r...
Karine Deschinkel, Sid Ahmed Ali Touati
CACM
2010
113views more  CACM 2010»
15 years 6 months ago
Reasoning about the unknown in static analysis
Static program analysis techniques cannot know certain values, such as the value of user input or network state, at analysis time. While such unknown values need to be treated as ...
Isil Dillig, Thomas Dillig, Alex Aiken
DISOPT
2008
85views more  DISOPT 2008»
15 years 6 months ago
How tight is the corner relaxation?
Given a mixed-integer linear programming (MILP) model and an optimal basis of the associated linear programming relaxation, the Gomory's corner relaxation is obtained by drop...
Matteo Fischetti, Michele Monaci