4926 search results - page 609 / 986 » Two Graph Algorithms On an Associative Computing Model |
116
Voted
ICRA
2008
IEEE
15 years 9 months ago
2008
IEEE
— Modeling robot motion planning with uncertainty in a Bayesian framework leads to a computationally intractable stochastic control problem. We seek hypotheses that can justify a...
135
click to vote
FOCS
1990
IEEE
15 years 6 months ago
1990
IEEE
Two of the most commonly used models in computational learning theory are the distribution-free model in which examples are chosen from a fixed but arbitrary distribution, and the ...
121
Voted
SODA
2008
ACM
15 years 4 months ago
2008
ACM
In the unconditionally reliable message transmission (URMT) problem, two non-faulty players, the sender S and the receiver R are part of a synchronous network modeled as a directe...
136
click to vote
SC
2000
ACM
15 years 6 months ago
2000
ACM
Adaptive applications have computational workloads and communication patterns which change unpredictably at runtime, requiring dynamic load balancing to achieve scalable performan...
112
click to vote
MVA
1990
15 years 3 months ago
1990
This paper proposes a novel representation of the free space of mobile robot by distinct, non-overlapping regions called Edge Visibility Regions (EVRs). An algorithm to partition ...