Even under polynomial restrictions on plan length, conformant planning remains a very hard computational problem as plan verification itself can take exponential time. This heavy ...
In parallel and distributed processing, tasks are ordinarily clustered and assigned to different processors or machines before they are scheduled. The assignment of tasks to proc...
The N - body problem is to simulate the motion of N particles under the influence of mutual force fields based on an inverse square law. Greengard's algorithm claims to compu...
Srinivas Aluru, Gurpur M. Prabhu, John L. Gustafso...
The paper characterizes the class of all concave resource allocation problems in interference coupled wireless systems. An axiomatic framework for interference functions proposed ...
We present an architectural approach to learning problem solving skills from demonstration, using internal models to represent problem-solving operational knowledge. Internal forwa...
Haris Dindo, Antonio Chella, Giuseppe La Tona, Mon...