Sciweavers

904 search results - page 177 / 181
» Game Theory
Sort
View
150
Voted
FOCS
2009
IEEE
15 years 10 months ago
Approximation Algorithms for Multicommodity-Type Problems with Guarantees Independent of the Graph Size
— Linial, London and Rabinovich [16] and Aumann and Rabani [3] proved that the min-cut max-flow ratio for general maximum concurrent flow problems (when there are k commodities...
Ankur Moitra
122
Voted
ATAL
2009
Springer
15 years 10 months ago
Abstraction in model checking multi-agent systems
ion in model checking multi-agent systems Mika Cohen Department of Computing Imperial College London London, UK Mads Dam Access Linnaeus Center Royal Institute of Technology Stockh...
Mika Cohen, Mads Dam, Alessio Lomuscio, Francesco ...
126
Voted
FC
2009
Springer
104views Cryptology» more  FC 2009»
15 years 10 months ago
Mitigating Inadvertent Insider Threats with Incentives
Inadvertent insiders are trusted insiders who do not have malicious intent (as with malicious insiders) but do not responsibly managing security. The result is often enabling a mal...
Debin Liu, XiaoFeng Wang, L. Jean Camp
152
Voted
ICAIL
2005
ACM
15 years 9 months ago
A study of accrual of arguments, with applications to evidential reasoning
d on Dung’s [4] abstract argumentation system • arguments: trees of chained defeasible inferences • aim: determine the status of a query given a belief base • incorporation...
Henry Prakken
130
Voted
GECCO
2005
Springer
112views Optimization» more  GECCO 2005»
15 years 9 months ago
Monotonic solution concepts in coevolution
Assume a coevolutionary algorithm capable of storing and utilizing all phenotypes discovered during its operation, for as long as it operates on a problem; that is, assume an algo...
Sevan G. Ficici