1197 search results - page 98 / 240 » Which Dynamic Constraint Problems Can Be Solved By Ants |
AAAI
2000
13 years 9 months ago
2000
Most CBR systems rely on a fixed library of cases, where each case consists of a set of facts specified in advance. This paper describes techniques for dynamically extracting case...
CVPR
2006
IEEE
14 years 10 months ago
2006
IEEE
Resolving local ambiguities is an important issue for shape from shading (SFS). Pixel ambiguities of SFS can be eliminated by propagation approaches. However, patch ambiguities st...
IROS
2006
IEEE
14 years 2 months ago
2006
IEEE
In this investigation a robotic system’s dynamic performance is optimized for high reliability under uncertainty. The dynamic capability equations allow designers to predict the...
DAC
2000
ACM
14 years 21 days ago
2000
ACM
In many modern designs, timing is either a key optimization goal and/or a mandatory constraint. We propose the first intellectual property protection technique using watermarking ...
JVCIR
2007
13 years 8 months ago
2007
The most popular approaches for the simulation of dynamic systems in computer graphics are force based. Internal and external forces are accumulated from which accelerations are c...