Sciweavers

7228 search results - page 134 / 1446
» From Algorithmic to Subjective Randomness
Sort
View
117
Voted
GECCO
2006
Springer
145views Optimization» more  GECCO 2006»
15 years 7 months ago
Multi-objective genetic algorithms for pipe arrangement design
This paper presents an automatic design method for piping arrangement. A pipe arrangement design problem is proposed for a space in which many pipes and objects co-exist. This pro...
Satoshi Ikehira, Hajime Kimura
110
Voted
GECCO
2005
Springer
135views Optimization» more  GECCO 2005»
15 years 9 months ago
Dynamic optimization of migration topology in internet-based distributed genetic algorithms
Distributed Genetic Algorithms (DGAs) designed for the Internet have to take its high communication cost into consideration. For island model GAs, the migration topology has a maj...
Johan Berntsson, Maolin Tang
117
Voted
MM
2010
ACM
238views Multimedia» more  MM 2010»
15 years 3 months ago
Vlfeat: an open and portable library of computer vision algorithms
VLFeat is an open and portable library of computer vision algorithms. It aims at facilitating fast prototyping and reproducible research for computer vision scientists and student...
Andrea Vedaldi, Brian Fulkerson
134
Voted
STOC
2007
ACM
111views Algorithms» more  STOC 2007»
16 years 3 months ago
Low-end uniform hardness vs. randomness tradeoffs for AM
In 1998, Impagliazzo and Wigderson [IW98] proved a hardness vs. randomness tradeoff for BPP in the uniform setting, which was subsequently extended to give optimal tradeoffs for t...
Ronen Shaltiel, Christopher Umans
145
Voted
OPODIS
2010
15 years 1 months ago
Application of Random Walks to Decentralized Recommender Systems
The need for efficient decentralized recommender systems has been appreciated for some time, both for the intrinsic advantages of decentralization and the necessity of integrating...
Anne-Marie Kermarrec, Vincent Leroy, Afshin Moin, ...