We analyse some recent approaches to the global illumination problem by introducing the corresponding reflection operators, and we demonstrate the advantages of a two-pass method....
How to estimate the shortest routing length when certain blocks are considered as routing obstacles is becoming an essential problem for block placement because HPWL is no longer v...
Tan Yan, Shuting Li, Yasuhiro Takashima, H. Murata
One of the main problems facing the development of ontology-aware authoring systems (OAS) is to link well-designed domain-independent knowledge (ontologies) with domain content. Su...
This paper presents two object manipulation planning methods based on fitted stratified and semi-stratified approaches using finger relocations. The problem is discussed in the fr...
We introduce the proximity rank join problem, where we are given a set of relations whose tuples are equipped with a score and a real-valued feature vector. Given a target feature...