1662 search results - page 283 / 333 » The Computational Complexity of Agent Design Problems |
CVPR
2006
IEEE
14 years 10 months ago
2006
IEEE
We address the problem of detecting complex articulated objects and their pose in 3D range scan data. This task is very difficult when the orientation of the object is unknown, an...
CASES
2005
ACM
13 years 10 months ago
2005
ACM
Computer security becomes increasingly important with continual growth of the number of interconnected computing platforms. Moreover, as capabilities of embedded processors increa...
IEEEPACT
2005
IEEE
14 years 2 months ago
2005
IEEE
VLIW architectures are popular in embedded systems because they offer high-performance processing at low cost and energy. The major problem with traditional VLIW designs is that t...
ATAL
2003
Springer
14 years 1 months ago
2003
Springer
Among humans, teaching various tasks is a complex process which relies on multiple means for interaction and learning, both on the part of the teacher and of the learner. Used tog...
SIGECOM
2010
ACM
13 years 9 months ago
2010
ACM
Cut games and party affiliation games are well-known classes of potential games. Schaffer and Yannakakis showed that computing pure Nash equilibrium in these games is PLScomplete....