2654 search results - page 92 / 531 » On Pairing Inversion Problems |
141
click to vote
AAAI
2006
15 years 6 months ago
2006
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 ...
130
Voted
RTA
1998
Springer
15 years 8 months ago
1998
Springer
There is a close relationship between word unification and second-order unification. This similarity has been exploited for instance for proving decidability of monadic second-orde...
147
click to vote
IAT
2006
IEEE
15 years 10 months ago
2006
IEEE
In this paper, we tackle learning in distributed systems and the fact that learning does not necessarily involve the participation of agents directly in the inductive process itse...
147
Voted
SAC
2005
ACM
15 years 10 months ago
2005
ACM
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...
131
click to vote
SC
1994
ACM
15 years 8 months ago
1994
ACM
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...