32 papers:
DAC-2013-AngioneCCLN #modelling- Pareto epsilon-dominance and identifiable solutions for BioCAD modeling (CA, JC, GC, PL, GN), p. 9.
ICALP-v1-2012-ShiW #optimisation- Epsilon-Net Method for Optimizations over Separable States (YS, XW), pp. 798–809.
ECMFA-2011-KolovosPRW #model management- Integrated Model Management with Epsilon (DSK, RFP, LMR, JRW), pp. 391–392.
ICML-2010-WunderLB #multi- Classes of Multiagent Q-learning Dynamics with epsilon-greedy Exploration (MW, MLL, MB), pp. 1167–1174.
ICMT-2010-RoseKPP #migration- Model Migration with Epsilon Flock (LMR, DSK, RFP, FACP), pp. 184–198.
VLDB-2009-LiuLGF #approximate #network #query- Enabling epsilon-Approximate Querying in Sensor Networks (YL, JL, HG, XF), pp. 169–180.
STOC-2009-AronovES- Small-size epsilon-nets for axis-parallel rectangles and boxes (BA, EE, MS), pp. 639–648.
STOC-2009-RabaniS #linear- Explicit construction of a small epsilon-net for linear threshold functions (YR, AS), pp. 649–658.
ECMDA-FA-2009-Kolovos #comparison #modelling- Establishing Correspondences between Models with the Epsilon Comparison Language (DSK), pp. 146–157.
ICALP-A-2008-Phillips #algorithm #approximate- Algorithms for epsilon-Approximations of Terrains (JMP), pp. 447–458.
ECMDA-FA-2008-RosePKP #generative- The Epsilon Generation Language (LMR, RFP, DSK, FP), pp. 1–16.
ICMT-2008-KolovosPP #model transformation- The Epsilon Transformation Language (DSK, RFP, FP), pp. 46–60.
TOOLS-EUROPE-2007-KolovosPPR #in the small- Update Transformations in the Small with the Epsilon Wizard Language (DSK, RFP, FP, LMR), pp. 53–69.
STOC-2006-Clarkson #using- Building triangulations using epsilon-nets (KLC), pp. 326–335.
CIAA-2006-GiraudVL #automaton #finite- Path-Equivalent Removals of epsilon-transitions in a Genomic Weighted Finite Automaton (MG, PV, DL), pp. 23–33.
ECMDA-FA-2006-KolovosPP- The Epsilon Object Language (EOL) (DSK, RFP, FP), pp. 128–142.
MoDELS-2006-KolovosPP #modelling- Merging Models with the Epsilon Merging Language (EML) (DSK, RFP, FP), pp. 215–229.
MoDELS-2006-KolovosPP #modelling- Merging Models with the Epsilon Merging Language (EML) (DSK, RFP, FP), pp. 215–229.
STOC-2005-Garg #approximate #graph #problem- Saving an epsilon: a 2-approximation for the k-MST problem in graphs (NG), pp. 396–402.
ICALP-2005-HromkovicS- NFAs With and Without epsilon-Transitions (JH, GS), pp. 385–396.
STOC-2004-ChekuriGKK #multi #scheduling- Multi-processor scheduling to minimize flow time with epsilon resource augmentation (CC, AG, SK, AK), pp. 363–372.
STOC-2003-Ben-SassonSVW #testing- Randomness-efficient low degree tests and short PCPs via epsilon-biased sets (EBS, MS, SPV, AW), pp. 612–621.
CSL-2003-MoserZ #calculus #tutorial- The Epsilon Calculus (Tutorial) (GM, RZ), p. 455.
STOC-2002-Holmerin #approximate- Vertex cover on 4-regular hyper-graphs is hard to approximate within 2-epsilon (JH), pp. 544–552.
ICML-2002-Bonet #algorithm #markov #process- An epsilon-Optimal Grid-Based Algorithm for Partially Observable Markov Decision Processes (BB), pp. 51–58.
CIAA-2001-Kempe #finite #transducer- Extraction of epsilon-Cyclesfrom Finite-State Transducers (AK), pp. 190–201.
STOC-2000-OrlinSS #combinator #optimisation #precise- epsilon-optimization schemes and L-bit precision: alternative perspectives in combinatorial optimization (extended abstract) (JBO, ASS, SS), pp. 565–572.
CIAA-2000-Mohri #algorithm #automaton- Generic epsilon -Removal Algorithm for Weighted Automata (MM), pp. 230–242.
RTA-1995-Asperti #exclamation #implementation #optimisation #λ-calculus- deltao!Epsilon = 1 — Optimizing Optimal λ-Calculus Implementations (AA), pp. 102–116.
STOC-1993-ChazelleEGGSW #bound #set- Improved bounds on weak epsilon-nets for convex sets (BC, HE, MG, LJG, MS, EW), pp. 495–504.
STOC-1992-LinV #approximate #constraints- epsilon-Approximations with Minimum Packing Constraint Violation (Extended Abstract) (JHL, JSV), pp. 771–782.
JICSCP-1988-CosciaFLST88 #compilation #logic programming- Meta-Level Definition and Compilation of Inference Engines in the Epsilon Logic Programming Environment (PC, PF, GL, GS, LT), pp. 359–373.