1594 search results - page 194 / 319 » An Algorithm to Compute Collusion Paths |
187
click to vote
LCPC
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. A fundamental problem in the analysis of parallel programs is to determine when two statements in a program may run concurrently. This analysis is the parallel analog to ...
144
click to vote
ISPD
1999
ACM
15 years 10 months ago
1999
ACM
—This paper studies a natural formulation of the timing-driven maze routing problem. A multigraph model appropriate for global routing applications is adopted; the model naturall...
175
click to vote
AAAI
1990
15 years 7 months ago
1990
The Symbolic Probabilistic Inference (SPI) Algorithm [D'Ambrosio, 19891 provides an efficient framework for resolving general queries on a belief network. It applies the conc...
149
click to vote
TROB
2008
15 years 6 months ago
2008
Abstract--This paper addresses the challenging problem of finding collision-free trajectories for many robots moving toward individual goals within a common environment. Most popul...
167
click to vote
WWW
2001
ACM
16 years 7 months ago
2001
ACM
Mobile computing is considered of major importance to the computing industry for the forthcoming years due to the progress in the wireless communications area. A proxy-based archi...