Sciweavers

9997 search results - page 279 / 2000
» The case for crowd computing
Sort
View
AAAI
2010
15 years 8 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
172
Voted
AAAI
2006
15 years 8 months ago
Improved Bounds for Computing Kemeny Rankings
Voting (or rank aggregation) is a general method for aggregating the preferences of multiple agents. One voting rule of particular interest is the Kemeny rule, which minimizes the...
Vincent Conitzer, Andrew J. Davenport, Jayant Kala...
IJCAI
2001
15 years 8 months ago
Computing Strongest Necessary and Weakest Sufficient Conditions of First-Order Formulas
A technique is proposed for computing the weakest sufficient (wsc) and strongest necessary (snc) conditions for formulas in an expressive fragment of first-order logic using quant...
Patrick Doherty, Witold Lukaszewicz, Andrzej Szala...
MASCOTS
2004
15 years 8 months ago
A Framework for Resource Allocation in Grid Computing
Grid computing is the future computing paradigm for enterprise applications. An enterprise application running on a grid is composed of a set of SLA-constrained sub-tasks demandin...
Daniel A. Menascé, Emiliano Casalicchio
NIPS
1998
15 years 8 months ago
Computational Differences between Asymmetrical and Symmetrical Networks
Symmetrically connected recurrent networks have recently been used as models of a host of neural computations. However, biological neural networks have asymmetrical connections, at...
Zhaoping Li, Peter Dayan