Sciweavers

4539 search results - page 489 / 908
» Approaches to Compute Workflow Complexity
Sort
View
CGI
2009
IEEE
15 years 10 months ago
Easy integral surfaces: a fast, quad-based stream and path surface algorithm
Despite the clear benefits that stream and path surfaces bring when visualizing 3D vector fields, their use in both industry and for research has not proliferated. This is due, in...
Tony McLoughlin, Robert S. Laramee, Eugene Zhang
GRID
2000
Springer
15 years 10 months ago
Architectural Models for Resource Management in the Grid
: The concept of coupling geographically distributed (high-end) resources for solving large-scale problems is becoming increasingly popular, forming what is popularly called grid c...
Rajkumar Buyya, Steve J. Chapin, David C. DiNucci
AAAI
2010
15 years 8 months ago
Integrating Sample-Based Planning and Model-Based Reinforcement Learning
Recent advancements in model-based reinforcement learning have shown that the dynamics of many structured domains (e.g. DBNs) can be learned with tractable sample complexity, desp...
Thomas J. Walsh, Sergiu Goschin, Michael L. Littma...
CGF
2007
158views more  CGF 2007»
15 years 6 months ago
Soft Articulated Characters with Fast Contact Handling
Fast contact handling of soft articulated characters is a computationally challenging problem, in part due to complex interplay between skeletal and surface deformation. We presen...
Nico Galoppo, Miguel A. Otaduy, Serhat Tekin, Mark...
JCP
2008
216views more  JCP 2008»
15 years 6 months ago
Direct Anonymous Attestation for Next Generation TPM
Trusted computing platforms have been proposed as a promising approach to enhance the security of general-purpose computing systems. Direct Anonymous Attestation(DAA) is a scheme t...
Xiaofeng Chen 0004, Dengguo Feng