Sciweavers

1662 search results - page 262 / 333
» The Computational Complexity of Agent Design Problems
Sort
View
ICRA
2010
IEEE
154views Robotics» more  ICRA 2010»
13 years 7 months ago
Multi-agent path planning with multiple tasks and distance constraints
— The DPC algorithm developed in our previous work is an efficient way of computing optimal trajectories for multiple robots in a distributed fashion with timeparameterized cons...
Subhrajit Bhattacharya, Maxim Likhachev, Vijay Kum...
IUI
2003
ACM
14 years 2 months ago
Lessons learned in modeling schizophrenic and depressed responsive virtual humans for training
This paper describes lessons learned in developing the linguistic, cognitive, emotional, and gestural models underlying virtual human behavior in a training application designed t...
Robert C. Hubal, Geoffrey A. Frank, Curry I. Guinn
MOBICOM
2003
ACM
14 years 2 months ago
Minimum energy disjoint path routing in wireless ad-hoc networks
We develop algorithms for finding minimum energy disjoint paths in an all-wireless network, for both the node and linkdisjoint cases. Our major results include a novel polynomial...
Anand Srinivas, Eytan Modiano
PERCOM
2004
ACM
14 years 8 months ago
A Mobility Gateway for Small-Device Networks
Networks of small devices, such as environmental sensors, introduce a number of new challenges for traditional protocols and approaches. In particular, the extreme resource constr...
Robert C. Chalmers, Kevin C. Almeroth
ICCAD
1997
IEEE
99views Hardware» more  ICCAD 1997»
14 years 29 days ago
High-level area and power estimation for VLSI circuits
High-level power estimation, when given only a high-level design specification such as a functional or RTL description, requires high-level estimation of the circuit average acti...
Mahadevamurty Nemani, Farid N. Najm