595 search results - page 70 / 119 » Using Constraints with Memory to Implement Variable Eliminat... |
110
click to vote
SAS
2009
Springer
16 years 3 months ago
2009
Springer
Polyhedra: An Abstract Domain to Infer Interval Linear Relationships Liqian Chen1,2 , Antoine Min?e2,3 , Ji Wang1 , and Patrick Cousot2,4 1 National Laboratory for Parallel and Dis...
DAC
2004
ACM
15 years 8 months ago
2004
ACM
A Module-Rased design flow for digital ICs with hard and sofl modules is presented. Versions of the sofl modules are implemented with different areddelay characteristics. The vers...
CAISE
2005
Springer
15 years 8 months ago
2005
Springer
Abstract Software Product Line (SPL) Engineering has proved to be an effective method for software production. However, in the SPL community it is well recognized that variability ...
140
Voted
PC
2010
15 years 1 months ago
2010
We consider the computation of shortest paths on Graphic Processing Units (GPUs). The blocked recursive elimination strategy we use is applicable to a class of algorithms (such as...
130
Voted
ISRR
2001
Springer
15 years 7 months ago
2001
Springer
Most of current machine vision systems suffer from a lack of flexibility to account for the high variability of unstructured environments. Here, as the state of the world evolves ...