Sciweavers

140 search results - page 19 / 28
» String Quartets In Binary
Sort
View
69
Voted
ECCC
2010
103views more  ECCC 2010»
14 years 9 months ago
Pseudorandom Generators for Regular Branching Programs
We give new pseudorandom generators for regular read-once branching programs of small width. A branching program is regular if the in-degree of every vertex in it is either 0 or 2...
Mark Braverman, Anup Rao, Ran Raz, Amir Yehudayoff
CORR
2010
Springer
90views Education» more  CORR 2010»
14 years 8 months ago
Perfect Omniscience, Perfect Secrecy and Steiner Tree Packing
— We consider perfect secret key generation for a “pairwise independent network” model in which every pair of terminals share a random binary string, with the strings shared ...
Sirin Nitinawarat, Prakash Narayan
GECCO
2009
Springer
145views Optimization» more  GECCO 2009»
15 years 4 months ago
Geometric differential evolution
Geometric Particle Swarm Optimization (GPSO) is a recently introduced formal generalization of traditional Particle Swarm Optimization (PSO) that applies naturally to both continu...
Alberto Moraglio, Julian Togelius
CEC
2008
IEEE
15 years 4 months ago
Solving one-billion-bit Noisy OneMax problem using Estimation Distribution Algorithm with Arithmetic Coding
— This paper presents an algorithm which combines Estimation Distribution Algorithm with a chromosome compression scheme to solve large scale Noisy OneMax problem. The search spa...
Worasait Suwannik, Prabhas Chongstitvatana
3DPVT
2002
IEEE
150views Visualization» more  3DPVT 2002»
15 years 2 months ago
Coding with ASCII: compact, yet text-based 3D content
Because of the convenience of a text-based format 3D content is often published in form of a gzipped file that contains an ASCII description of the scene graph. While compressed ...
Martin Isenburg, Jack Snoeyink