400 search results - page 46 / 80 » Parallel Algorithms with Optimal Speedup for Bounded Treewid... |
137
click to vote
UAI
2004
15 years 5 months ago
2004
We present a novel POMDP planning algorithm called heuristic search value iteration (HSVI). HSVI is an anytime algorithm that returns a policy and a provable bound on its regret w...
126
click to vote
VLDB
1991
ACM
15 years 7 months ago
1991
ACM
A non-equijoin of relations R and S is a band join if the join predicate requires values in the join attribute of R to fall within a speci ed band about the values in the join att...
135
click to vote
AI
2005
Springer
15 years 3 months ago
2005
Springer
The Distributed Constraint Optimization Problem (DCOP) is able to model a wide variety of distributed reasoning tasks that arise in multiagent systems. Unfortunately, existing met...
148
click to vote
SPAA
2006
ACM
15 years 10 months ago
2006
ACM
One of the fundamental trade-offs in compact routing schemes is between the space used to store the routing table on each node and the stretch factor of the routing scheme – th...
119
click to vote
AINA
2006
IEEE
15 years 10 months ago
2006
IEEE
In this paper we study the problem of scheduling messages between two parallel machines connected by a low latency network during a data redistribution. We compare two approaches....