Sciweavers

5608 search results - page 839 / 1122
» On the Theory of Matchgate Computations
Sort
View
ATAL
2010
Springer
15 years 7 months ago
Ants meeting algorithms
Ant robots have very low computational power and limited memory. They communicate by leaving pheromones in the environment. In order to create a cooperative intelligent behavior, ...
Asaf Shiloni, Alon Levy, Ariel Felner, Meir Kalech
ATAL
2010
Springer
15 years 7 months ago
Risk-sensitive planning in partially observable environments
Partially Observable Markov Decision Process (POMDP) is a popular framework for planning under uncertainty in partially observable domains. Yet, the POMDP model is riskneutral in ...
Janusz Marecki, Pradeep Varakantham
ATAL
2010
Springer
15 years 7 months ago
Complexity of judgment aggregation: safety of the agenda
Aggregating the judgments of a group of agents regarding a set of interdependent propositions can lead to inconsistent outcomes. One of the parameters involved is the agenda, the ...
Ulle Endriss, Umberto Grandi, Daniele Porello
ATAL
2010
Springer
15 years 7 months ago
Divide-and-coordinate: DCOPs by agreement
In this paper we investigate an approach to provide approximate, anytime algorithms for DCOPs that can provide quality guarantees. At this aim, we propose the divide-and-coordinat...
Meritxell Vinyals, Marc Pujol, Juan A. Rodrí...
BIRTHDAY
2010
Springer
15 years 7 months ago
DKAL and Z3: A Logic Embedding Experiment
Yuri Gurevich and Itay Neeman proposed the Distributed Knowledge Authorization Language, DKAL, as an expressive, yet very succinctly expressible logic for distributed authorization...
Sergio Mera, Nikolaj Bjørner