Sciweavers

2841 search results - page 45 / 569
» A Call to Order
Sort
View
ORDER
2008
61views more  ORDER 2008»
14 years 9 months ago
Partitioning Posets
Given a poset P = (X, ), a partition X1, . . . , Xk of X is called an ordered partition of P if, whenever x Xi and y Xj with x y, then i j. In this paper, we show that for ever...
Viresh Patel
SAC
2005
ACM
15 years 3 months ago
On unit task linear-nonlinear two-cluster scheduling problem
In parallel and distributed processing, tasks are ordinarily clustered and assigned to different processors or machines before they are scheduled. The assignment of tasks to proc...
Zhichun Xiao, Wing Ning Li, John Jing-Fu Jenq
CGIM
2003
14 years 11 months ago
Silhouette-Opaque Transparency Rendering
Transparency in 3D graphics has traditionally been created by ordering the transparent objects from back-to-front with respect to the viewpoint, and rendering the opaque objects ï...
O. Sen, C. Chemudugunta, M. Gopi
CAV
2007
Springer
108views Hardware» more  CAV 2007»
15 years 1 months ago
Parametric and Sliced Causality
Abstract. Happen-before causal partial orders have been widely used in concurrent program verification and testing. This paper presents a parametric approach to happen-before causa...
Feng Chen, Grigore Rosu
ICCD
2003
IEEE
104views Hardware» more  ICCD 2003»
15 years 3 months ago
Non-Crossing OBDDs for Mapping to Regular Circuit Structures
In this paper, we propose a novel compact BDD structure, called Non-crossing ordered BDD (NCOBDD), that can be mapped directly to a regular circuit structure. Compared with other ...
Aiqun Cao, Cheng-Kok Koh