1197 search results - page 153 / 240 » Which Dynamic Constraint Problems Can Be Solved By Ants |
CVPR
2000
IEEE
14 years 10 months ago
2000
IEEE
In this paper we present a novel approach to estimate and analyze 3D uid structure and motion of clouds from multi-spectrum 2D cloud image sequences. Accurate cloud-top structure ...
IEEECIT
2009
IEEE
14 years 2 months ago
2009
IEEE
Cloud platforms host several independent applications on a shared resource pool with the ability to allocate computing power to applications on a per-demand basis. The use of serv...
JPDC
2006
13 years 8 months ago
2006
We present provably efficient parallel algorithms for sweep scheduling, which is a commonly used technique in Radiation Transport problems, and involves inverting an operator by i...
ISPD
2000
ACM
14 years 17 days ago
2000
ACM
modules can be handled in constraint graphs efficiently. This Floorplan area minimization is an important problem because many modules have shape flexibilities during the floorplan...
UIST
1997
ACM
13 years 11 months ago
1997
ACM
We propose interactive beautification, a technique for rapid geometric design, and introduce the technique and its algorithm with a prototype system Pegasus. The motivation is to ...