Sciweavers

959 search results - page 12 / 192
» Possible and Necessary h-Indices
Sort
View
ISCA
2011
IEEE
273views Hardware» more  ISCA 2011»
12 years 11 months ago
Bypass and insertion algorithms for exclusive last-level caches
Inclusive last-level caches (LLCs) waste precious silicon estate due to cross-level replication of cache blocks. As the industry moves toward cache hierarchies with larger inner l...
Jayesh Gaur, Mainak Chaudhuri, Sreenivas Subramone...
AAAI
2012
11 years 10 months ago
The Price of Neutrality for the Ranked Pairs Method
The complexity of the winner determination problem has been studied for almost all common voting rules. A notable exception, possibly caused by some confusion regarding its exact ...
Markus Brill, Felix A. Fischer
IJEB
2008
92views more  IJEB 2008»
13 years 7 months ago
Sponsored search: an overview of the concept, history, and technology
: The success of sponsored search has radically affected how people interact with the information, websites, and services on the web. Sponsored search provides the necessary revenu...
Bernard J. Jansen, Tracy Mullen
AAMAS
2012
Springer
12 years 3 months ago
Winner determination in voting trees with incomplete preferences and weighted votes
In multiagent settings where agents have different preferences, preference aggregation can be an important issue. Voting is a general method to aggregate preferences. We consider ...
Jérôme Lang, Maria Silvia Pini, Franc...
AI
2006
Springer
13 years 7 months ago
On the computational complexity of coalitional resource games
We study Coalitional Resource Games (CRGs), a variation of Qualitative Coalitional Games (QCGs) in which each agent is endowed with a set of resources, and the ability of a coalit...
Michael Wooldridge, Paul E. Dunne