Sciweavers

2074 search results - page 392 / 415
» Using an Object Reference Approach to Distributed Updates
Sort
View
CGF
2008
200views more  CGF 2008»
13 years 7 months ago
Deep Opacity Maps
We present a new method for rapidly computing shadows from semi-transparent objects like hair. Our deep opacity maps method extends the concept of opacity shadow maps by using a d...
Cem Yuksel, John Keyser
EJIS
2007
115views more  EJIS 2007»
13 years 7 months ago
Towards agent-oriented model-driven architecture
Model-Driven Architecture (MDA) supports the transformation from reusable models to executable software. Business representations, however, cannot be fully and explicitly represen...
Liang Xiao 0002, Des Greer
JAIR
2007
141views more  JAIR 2007»
13 years 7 months ago
Bin Completion Algorithms for Multicontainer Packing, Knapsack, and Covering Problems
Many combinatorial optimization problems such as the bin packing and multiple knapsack problems involve assigning a set of discrete objects to multiple containers. These problems ...
Alex S. Fukunaga, Richard E. Korf
COMPUTER
2002
129views more  COMPUTER 2002»
13 years 7 months ago
Networks on Chips: A New SoC Paradigm
of abstraction and coarse granularity and distributed communication control. Focusing on using probabilistic metrics such as average values or variance to quantify design objective...
Luca Benini, Giovanni De Micheli
SAC
2006
ACM
14 years 1 months ago
Interval-based robust statistical techniques for non-negative convex functions, with application to timing analysis of computer
: In chip design, one of the main objectives is to decrease its clock cycle; however, the existing approaches to timing analysis under uncertainty are based on fundamentally restri...
Michael Orshansky, Wei-Shen Wang, Martine Ceberio,...