8728 search results - page 1354 / 1746 » On Reduct Construction Algorithms |
175
Voted
ATAL
2004
Springer
16 years 7 days ago
2004
Springer
Partially observable decentralized decision making in robot teams is fundamentally different from decision making in fully observable problems. Team members cannot simply apply si...
162
click to vote
ATAL
2004
Springer
16 years 7 days ago
2004
Springer
Decision-theoretic models have become increasingly popular as a basis for solving agent and multiagent problems, due to their ability to quantify the complex uncertainty and prefe...
158
click to vote
ESA
2004
Springer
16 years 6 days ago
2004
Springer
For planar graphs, counting the number of perfect matchings (and hence determining whether there exists a perfect matching) can be done in NC [4, 10]. For planar bipartite graphs, ...
161
click to vote
GCC
2004
Springer
16 years 6 days ago
2004
Springer
Abstract. Multicast is an effective means for conducting the cooperative P2P communications. This paper studies an algorithm to construct a scalable and efficient end host multica...
176
click to vote
ICALP
2004
Springer
16 years 6 days ago
2004
Springer
We present a domain-theoretic version of Picard’s theorem for solving classical initial value problems in Rn . For the case of vector fields that satisfy a Lipschitz condition, ...