Sciweavers

1972 search results - page 158 / 395
» Evolutionary algorithms and dynamic programming
Sort
View
SIGGRAPH
1994
ACM
15 years 6 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
ICPP
2005
IEEE
15 years 8 months ago
Filter Decomposition for Supporting Coarse-Grained Pipelined Parallelism
We consider the filter decomposition problem in supporting coarse-grained pipelined parallelism. This form of parallelism is suitable for data-driven applications in scenarios wh...
Wei Du, Gagan Agrawal
CATS
2007
15 years 3 months ago
Planning with Time Limits in BDI Agent Programming Languages
This paper provides a theoretical basis for performing time limited planning within Belief-Desire-Intention (BDI) agents. The BDI agent architecture is recognised as one of the mo...
Lavindra de Silva, Anthony Dekker, James Harland
PLDI
1997
ACM
15 years 6 months ago
Dynamic Feedback: An Effective Technique for Adaptive Computing
This paper presents dynamic feedback, a technique that enables computations to adapt dynamically to different execution environments. A compiler that uses dynamic feedback produce...
Pedro C. Diniz, Martin C. Rinard
ASPLOS
2011
ACM
14 years 6 months ago
On-the-fly elimination of dynamic irregularities for GPU computing
The power-efficient massively parallel Graphics Processing Units (GPUs) have become increasingly influential for scientific computing over the past few years. However, their ef...
Eddy Z. Zhang, Yunlian Jiang, Ziyu Guo, Kai Tian, ...