Sciweavers

5316 search results - page 86 / 1064
» Which Search Problems Are Random
Sort
View
ICIP
2009
IEEE
14 years 11 months ago
Random swap EM algorithm for finite mixture models in image segmentation
The Expectation-Maximization (EM) algorithm is a popular tool in statistical estimation problems involving incomplete data or in problems which can be posed in a similar form, suc...
Qinpei Zhao, Ville Hautamäki, Ismo Kärkk...
GECCO
2006
Springer
195views Optimization» more  GECCO 2006»
15 years 4 months ago
Studying XCS/BOA learning in Boolean functions: structure encoding and random Boolean functions
Recently, studies with the XCS classifier system on Boolean functions have shown that in certain types of functions simple crossover operators can lead to disruption and, conseque...
Martin V. Butz, Martin Pelikan
COR
2007
86views more  COR 2007»
15 years 29 days ago
Sourcing with random yields and stochastic demand: A newsvendor approach
We studied a supplier selection problem, where a buyer, while facing random demand, is to decide ordering quantities from a set of suppliers with different yields and prices.We pr...
Shitao Yang, Jian Yang, Layek Abdel-Malek
NETWORKS
2008
15 years 1 months ago
Reformulation and sampling to solve a stochastic network interdiction problem
The Network Interdiction Problem involves interrupting an adversary's ability to maximize flow through a capacitated network by destroying portions of the network. A budget c...
Udom Janjarassuk, Jeff Linderoth
MLQ
2007
72views more  MLQ 2007»
15 years 20 days ago
Mass problems and almost everywhere domination
We examine the concept of almost everywhere domination from the viewpoint of mass problems. Let AED and MLR be the set of reals which are almost everywhere dominating and Martin-L...
Stephen G. Simpson