Sciweavers

24 search results - page 5 / 5
» Distributed Almost Exact Approximations for Minor-Closed Fam...
Sort
View
GECCO
2008
Springer
145views Optimization» more  GECCO 2008»
13 years 5 months ago
Memory with memory: soft assignment in genetic programming
Based in part on observations about the incremental nature of most state changes in biological systems, we introduce the idea of Memory with Memory in Genetic Programming (GP), wh...
Nicholas Freitag McPhee, Riccardo Poli
STOC
2009
ACM
96views Algorithms» more  STOC 2009»
14 years 5 months ago
MaxMin allocation via degree lower-bounded arborescences
We consider the problem of MaxMin allocation of indivisible goods. There are m items to be distributed among n players. Each player i has a nonnegative valuation pij for an item j...
MohammadHossein Bateni, Moses Charikar, Venkatesan...
VLDB
2004
ACM
180views Database» more  VLDB 2004»
13 years 9 months ago
Bloom Histogram: Path Selectivity Estimation for XML Data with Updates
Cost-based XML query optimization calls for accurate estimation of the selectivity of path expressions. Some other interactive and internet applications can also benefit from suc...
Wei Wang 0011, Haifeng Jiang, Hongjun Lu, Jeffrey ...
SIGMETRICS
2008
ACM
181views Hardware» more  SIGMETRICS 2008»
13 years 4 months ago
Counter braids: a novel counter architecture for per-flow measurement
Fine-grained network measurement requires routers and switches to update large arrays of counters at very high link speed (e.g. 40 Gbps). A naive algorithm needs an infeasible amo...
Yi Lu, Andrea Montanari, Balaji Prabhakar, Sarang ...