Sciweavers

932 search results - page 76 / 187
» Uniform Random Number Generators
Sort
View
SIGECOM
2008
ACM
103views ECommerce» more  SIGECOM 2008»
15 years 6 months ago
A sufficient condition for voting rules to be frequently manipulable
The Gibbard-Satterthwaite Theorem states that (in unrestricted settings) any reasonable voting rule is manipulable. Recently, a quantitative version of this theorem was proved by ...
Lirong Xia, Vincent Conitzer
IPPS
2005
IEEE
15 years 11 months ago
Dynamic Task Scheduling using Genetic Algorithms for Heterogeneous Distributed Computing
An algorithm has been developed to dynamically schedule heterogeneous tasks on heterogeneous processors in a distributed system. The scheduler operates in an environment with dyna...
Andrew J. Page, Thomas J. Naughton
EMO
2001
Springer
125views Optimization» more  EMO 2001»
15 years 10 months ago
Adapting Weighted Aggregation for Multiobjective Evolution Strategies
The conventional weighted aggregation method is extended to realize multi-objective optimization. The basic idea is that systematically changing the weights during evolution will l...
Yaochu Jin, Tatsuya Okabe, Bernhard Sendhoff
SIGGRAPH
1996
ACM
15 years 10 months ago
Consequences of Stratified Sampling in Graphics
Antialiased pixel values are often computed as the mean of N point samples. Using uniformly distributed random samples, the central limit theorem predicts a variance of the mean o...
Don P. Mitchell
ICCV
2003
IEEE
16 years 8 months ago
A Multi-scale Generative Model for Animate Shapes and Parts
This paper presents a multi-scale generative model for representing animate shapes and extracting meaningful parts of objects. The model assumes that animate shapes (2D simple clo...
Aleksandr Dubinskiy, Song Chun Zhu