Sciweavers

1728 search results - page 123 / 346
» Social Computing: Fundamentals and applications
Sort
View
LPNMR
2009
Springer
14 years 2 months ago
Belief Revision with Bounded Treewidth
Problems arising from the revision of propositional knowledge bases have been intensively studied for two decades. Many different approaches to revision have thus been suggested, w...
Reinhard Pichler, Stefan Rümmele, Stefan Wolt...
MMAS
2004
Springer
14 years 1 months ago
Towards Fault-Tolerant Massively Multiagent Systems
Abstract. In order to construct and deploy massively multiagent systems, we must address one of the fundamental issues of distributed systems, the possibility of partial failures. ...
Zahia Guessoum, Jean-Pierre Briot, Nora Faci
VLDB
1994
ACM
114views Database» more  VLDB 1994»
13 years 12 months ago
Relating Distributed Objects
Many relational and object-oriented database systems provide referential integrity and compound operations on related objects using relationship mechanisms. Distributed object sys...
Bruce E. Martin, R. G. G. Cattell
AAAI
2010
13 years 9 months ago
Dominance Testing via Model Checking
Dominance testing, the problem of determining whether an outcome is preferred over another, is of fundamental importance in many applications. Hence, there is a need for algorithm...
Ganesh Ram Santhanam, Samik Basu, Vasant Honavar
AAAI
2006
13 years 9 months ago
Computing Slater Rankings Using Similarities among Candidates
Voting (or rank aggregation) is a general method for aggregating the preferences of multiple agents. One important voting rule is the Slater rule. It selects a ranking of the alte...
Vincent Conitzer