Sciweavers

494 search results - page 44 / 99
» Probabilistic Programming in Anglican
Sort
View
GECCO
2008
Springer
152views Optimization» more  GECCO 2008»
14 years 11 months ago
Accelerating genetic programming by frequent subtree mining
One crucial issue in genetic programming (GP) is how to acquire promising building blocks efficiently. In this paper, we propose a GP method (called GPTM, GP with Tree Mining) whi...
Yoshitaka Kameya, Junichi Kumagai, Yoshiaki Kurata
113
Voted
EUSFLAT
2009
114views Fuzzy Logic» more  EUSFLAT 2009»
14 years 8 months ago
The Use of Interval-Valued Probability Measures in Fuzzy Linear Programming: a constraint set approach
This paper uses a constraint set approach to linear programming problems with equality constraints whose coefficients and/or right-hand side values could be uncertain. We consider ...
Phantipa Thipwiwatpotjana, Weldon A. Lodwick
72
Voted
ATS
2003
IEEE
105views Hardware» more  ATS 2003»
15 years 3 months ago
Minimizing Defective Part Level Using a Linear Programming-Based Optimal Test Selection Method
Recent probabilistic test generation approaches have proven that detecting single stuck-at faults multiple times is effective at reducing the defective part level (DPL). Unfortuna...
Yuxin Tian, Michael R. Grimaila, Weiping Shi, M. R...
GECCO
2007
Springer
276views Optimization» more  GECCO 2007»
15 years 4 months ago
Meta-optimizing semantic evolutionary search
I present MOSES (meta-optimizing semantic evolutionary search), a new probabilistic modeling (estimation of distribution) approach to program evolution. Distributions are not esti...
Moshe Looks
86
Voted
SSDBM
2005
IEEE
148views Database» more  SSDBM 2005»
15 years 3 months ago
A Fast Approximation Scheme for Probabilistic Wavelet Synopses
Several studies have demonstrated the effectiveness of Haar wavelets in reducing large amounts of data down to compact wavelet synopses that can be used to obtain fast, accurate a...
Antonios Deligiannakis, Minos N. Garofalakis, Nick...