3171 search results - page 359 / 635 » Application of Reduce Order Modeling to Time Parallelization |
122
click to vote
GLVLSI
2003
IEEE
15 years 9 months ago
2003
IEEE
The MINCE heuristic for variable-ordering [1] successfully reduces the size of BDDs and can accelerate SAT-solving. Applications to reachability analysis have also been successful...
127
click to vote
WOSP
2010
ACM
15 years 11 months ago
2010
ACM
For garbage-collected applications, dynamically-allocated objects are contained in a heap. Programmer productivity improves significantly if there is a garbage collector to autom...
167
click to vote
ICCAD
2006
IEEE
16 years 1 months ago
2006
IEEE
— This paper presents a robust quadratic placement approach, which offers both high-quality placements and excellent computational efficiency. The additional force which distrib...
136
click to vote
FCCM
2002
IEEE
15 years 9 months ago
2002
IEEE
To fully realize the benefits of partial and rapid reconfiguration of field-programmable devices, we often need to dynamically schedule computing tasks and generate instance-sp...
222
click to vote
IJCNN
2006
IEEE
15 years 10 months ago
2006
IEEE
—This paper presents an Improved Snake Model (ISM) effective for performing fast image segmentation. The work takes advantage of two well-known snake models of Balloon [1] and GG...