Sciweavers

10568 search results - page 392 / 2114
» Computer Intelligence and Formalization
Sort
View
174
Voted
DALT
2009
Springer
15 years 8 months ago
Computing Utility from Weighted Description Logic Preference Formulas
We propose a framework to compute the utility of a proposal w.r.t. a preference set in a negotiation process. In particular, we refer to preferences expressed as weighted formulas ...
Azzurra Ragone, Tommaso Di Noia, Francesco M. Doni...
155
Voted
AAAI
2007
15 years 6 months ago
Computational Complexity of Weighted Threshold Games
Weighted threshold games are coalitional games in which each player has a weight (intuitively corresponding to its voting power), and a coalition is successful if the sum of its w...
Edith Elkind, Leslie Ann Goldberg, Paul W. Goldber...
142
Voted
ATAL
2008
Springer
15 years 6 months ago
Combining Cognitive with Computational Trust Reasoning
We propose a concept that combines the cognitive with the computational approaches to experience-based trust reasoning. We emphasize that a cognitive component is vital for computa...
Eugen Staab, Thomas Engel
CEC
2005
IEEE
15 years 6 months ago
DNA implementation of k-shortest paths computation
In this paper, a demonstration of DNA computing for k-shortest paths of a weighted graph is realized by biochemical experiments in such a way that every path is encoded by oligonuc...
Zuwairie Ibrahim, Yusei Tsuboi, Mohd Saufee Muhamm...
AAAI
2010
15 years 6 months ago
Complexity of Computing Optimal Stackelberg Strategies in Security Resource Allocation Games
Recently, algorithms for computing game-theoretic solutions have been deployed in real-world security applications, such as the placement of checkpoints and canine units at Los An...
Dmytro Korzhyk, Vincent Conitzer, Ronald Parr