Sciweavers

2027 search results - page 2 / 406
» Approximating power indices
Sort
View
CIKM
1997
Springer
13 years 9 months ago
Block Addressing Indices for Approximate Text Retrieval
Although the issue of approximate text retrieval is gaining importance in the last years, it is currently addressed by only a few indexing schemes. To reduce space requirements, t...
Ricardo A. Baeza-Yates, Gonzalo Navarro
GECCO
2009
Springer
148views Optimization» more  GECCO 2009»
13 years 11 months ago
Multiplicative approximations and the hypervolume indicator
Indicator-based algorithms have become a very popular approach to solve multi-objective optimization problems. In this paper, we contribute to the theoretical understanding of alg...
Tobias Friedrich, Christian Horoba, Frank Neumann
KDD
2006
ACM
157views Data Mining» more  KDD 2006»
14 years 5 months ago
Using structure indices for efficient approximation of network properties
Statistics on networks have become vital to the study of relational data drawn from areas such as bibliometrics, fraud detection, bioinformatics, and the Internet. Calculating man...
Matthew J. Rattigan, Marc Maier, David Jensen
CORR
2008
Springer
113views Education» more  CORR 2008»
13 years 5 months ago
Power Indices and minimal winning Coalitions
The Penrose-Banzhaf index and the Shapley-Shubik index are the best-known and the most used tools to measure political power of voters in simple voting games. Most methods to calc...
Werner Kirsch, Jessica Langner
EOR
2011
140views more  EOR 2011»
12 years 12 months ago
Power indices of simple games and vector-weighted majority games by means of binary decision diagrams
A simple game is a pair consisting of a finite set N of players and a set W ⊆ 2N of winning coalitions. (Vector-)weighted majority games ((V)WMG) are a special case of simple ga...
Stefan Bolus