Sciweavers

INFORMS
2007
62views more  INFORMS 2007»
13 years 11 months ago
On a Binary-Encoded ILP Coloring Formulation
We further develop the 0/1 ILP formulation of Lee for edge coloring where colors are encoded in binary. With respect to that formulation, our main contributions are: (i) an effici...
Jon Lee, François Margot
IPCO
2004
94views Optimization» more  IPCO 2004»
14 years 18 days ago
More on a Binary-Encoded Coloring Formulation
We further develop the 0/1 ILP formulation of Lee for edge coloring where colors are encoded in binary. With respect to that formulation, our main contributions are: (i) an efficie...
Jon Lee, François Margot
ISSS
1997
IEEE
109views Hardware» more  ISSS 1997»
14 years 3 months ago
Reducing the Complexity of ILP Formulations for Synthesis
Integer Linear Programming ILP is commonly used in high level and system level synthesis. It is an NP-Complete problem in general cases. There exists some tools that give an o...
Anne Mignotte, Olivier Peyran
ASPDAC
2006
ACM
119views Hardware» more  ASPDAC 2006»
14 years 5 months ago
Using speculative computation and parallelizing techniques to improve scheduling of control based designs
Recent research results have seen the application of parallelizing techniques to high-level synthesis. In particular, the effect of speculative code transformations on mixed contr...
Roberto Cordone, Fabrizio Ferrandi, Marco D. Santa...
VLSID
2002
IEEE
130views VLSI» more  VLSID 2002»
14 years 11 months ago
Using Randomized Rounding to Satisfy Timing Constraints of Real-Time Preemptive Tasks
In preemptive real-time systems, a tighter estimate of the Worst Case Response Time(WCRT) of the tasks can be obtained if the layout of the tasks in memory is included in the esti...
Anupam Datta, Sidharth Choudhury, Anupam Basu