355 search results - page 12 / 71 » A general, fully distributed multi-agent planning algorithm |
180
click to vote
ICDE
2008
IEEE
16 years 1 months ago
2008
IEEE
In this paper we address the problem of minimizing the response time of a multi-way join query using pipelined (inter-operator) parallelism, in a parallel or a distributed environ...
99
Voted
WDAG
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. In this paper, we present fast and fully distributed algorithms for matching in weighted trees and general weighted graphs. The time complexity as well as the approximati...
127
click to vote
WS
2005
ACM
15 years 5 months ago
2005
ACM
Mobile ad hoc networks (MANETs) offer communication over a shared wireless channel without any pre-existing infrastructure. Forming peer-to-peer security associations in MANETs i...
COLT
2006
Springer
15 years 3 months ago
2006
Springer
Abstract. We present a unified and complete account of maximum entropy distribution estimation subject to constraints represented by convex potential functions or, alternatively, b...
98
Voted
AIPS
2006
15 years 1 months ago
2006
Planning as satisfiability (SAT-Plan) is one of the best approaches to optimal planning, which has been shown effective on problems in many different domains. However, the potenti...