Sciweavers

15494 search results - page 387 / 3099
» Computing dynamic clusters
Sort
View
SIGGRAPH
1994
ACM
15 years 11 months ago
Fast contact force computation for nonpenetrating rigid bodies
A new algorithm for computing contact forces between solid objects with friction is presented. The algorithm allows a mix of contact points with static and dynamic friction. In co...
David Baraff
ECIS
2004
15 years 8 months ago
To play, or not to play: building a learning environment through computer simulations
This article analyzes the impact of a computer simulation (business game) on the users' perceived learning. The theoretical model developed in this paper is derived from the ...
Luigi Proserpio, Magni Magni
ICS
2007
Tsinghua U.
16 years 29 days ago
Automatic nonblocking communication for partitioned global address space programs
Overlapping communication with computation is an important optimization on current cluster architectures; its importance is likely to increase as the doubling of processing power ...
Wei-Yu Chen, Dan Bonachea, Costin Iancu, Katherine...
CEC
2008
IEEE
16 years 1 months ago
Methods for decreasing the number of objective evaluations for independent computationally expensive objective problems
— In this paper, three new methods for pushing solutions toward a desired region of the objective space more quickly are explored; hypercube distance scaling, dynamic objective t...
Greg Rohling
CVPR
2005
IEEE
16 years 8 months ago
A Bayesian Approach to Unsupervised Feature Selection and Density Estimation Using Expectation Propagation
We propose an approximate Bayesian approach for unsupervised feature selection and density estimation, where the importance of the features for clustering is used as the measure f...
Shaorong Chang, Nilanjan Dasgupta, Lawrence Carin