Sciweavers

10988 search results - page 2031 / 2198
» Algorithmic Folding Complexity
Sort
View
GECCO
2003
Springer
112views Optimization» more  GECCO 2003»
16 years 1 days ago
Limits in Long Path Learning with XCS
The development of the XCS Learning Classifier System [26] has produced a stable implementation, able to consistently identify the accurate and optimally general population of cla...
Alwyn Barry
COMPGEOM
2010
ACM
15 years 12 months ago
Incidences in three dimensions and distinct distances in the plane
d Abstract] György Elekes Eötvös University Micha Sharir Tel Aviv University and New York University We first describe a reduction from the problem of lower-bounding the numbe...
György Elekes, Micha Sharir
PLDI
2010
ACM
15 years 12 months ago
Resolving and exploiting the k-CFA paradox: illuminating functional vs. object-oriented program analysis
Low-level program analysis is a fundamental problem, taking the shape of “flow analysis” in functional languages and “points-to” analysis in imperative and object-oriente...
Matthew Might, Yannis Smaragdakis, David Van Horn
PLDI
2010
ACM
15 years 12 months ago
Adversarial memory for detecting destructive races
Multithreaded programs are notoriously prone to race conditions, a problem exacerbated by the widespread adoption of multi-core processors with complex memory models and cache coh...
Cormac Flanagan, Stephen N. Freund
PODS
2010
ACM
306views Database» more  PODS 2010»
15 years 12 months ago
Optimizing linear counting queries under differential privacy
Differential privacy is a robust privacy standard that has been successfully applied to a range of data analysis tasks. But despite much recent work, optimal strategies for answe...
Chao Li, Michael Hay, Vibhor Rastogi, Gerome Mikla...
« Prev « First page 2031 / 2198 Last » Next »