Sciweavers

438 search results - page 70 / 88
» A Theory of Competitive Analysis for Distributed Algorithms
Sort
View
ATAL
2009
Springer
14 years 2 months ago
False name manipulations in weighted voting games: splitting, merging and annexation
An important aspect of mechanism design in social choice protocols and multiagent systems is to discourage insincere and manipulative behaviour. We examine the computational compl...
Haris Aziz, Mike Paterson
SIGECOM
2010
ACM
183views ECommerce» more  SIGECOM 2010»
14 years 6 days ago
The unavailable candidate model: a decision-theoretic view of social choice
One of the fundamental problems in the theory of social choice is aggregating the rankings of a set of agents (or voters) into a consensus ranking. Rank aggregation has found appl...
Tyler Lu, Craig Boutilier
GECCO
2010
Springer
187views Optimization» more  GECCO 2010»
14 years 6 days ago
The maximum hypervolume set yields near-optimal approximation
In order to allow a comparison of (otherwise incomparable) sets, many evolutionary multiobjective optimizers use indicator functions to guide the search and to evaluate the perfor...
Karl Bringmann, Tobias Friedrich
GECCO
2006
Springer
133views Optimization» more  GECCO 2006»
13 years 11 months ago
A general coarse-graining framework for studying simultaneous inter-population constraints induced by evolutionary operations
The use of genotypic populations is necessary for adaptation in Evolutionary Algorithms. We use a technique called form-invariant commutation to study the immediate effect of evol...
Keki M. Burjorjee, Jordan B. Pollack
PVG
2003
IEEE
212views Visualization» more  PVG 2003»
14 years 20 days ago
SLIC: Scheduled Linear Image Compositing for Parallel Volume Rendering
Parallel volume rendering offers a feasible solution to the large data visualization problem by distributing both the data and rendering calculations among multiple computers con...
Aleksander Stompel, Kwan-Liu Ma, Eric B. Lum, Jame...